Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 


Quelle  well_ordered_finite.prf   Sprache: Lisp

 
java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
 (nonempty_has_least                                        
nonempty_has_least-13662java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
   (""                        )
    (("" (expandnil)
      (("(!
        (("" (lemma "non_empty_finite_has_least")
                        )
(  { | !()AND()t !)"
             "reflexive_closure(<)")
            (("1" (expand "has_least?")
              (("1" (skolem!)) ((2 assertnilnil) )
                (("1" (inst + "t!1")
                  (("1"                           *"" " union"
                    (("1" (grind :if-match nil                          ("3"() ) )
                      niljava.lang.StringIndexOutOfBoundsException: Range [27, 28) out of bounds for length 27
(""()  )
                         ("2" (inst - "t!1" "r!1")
                          (("2" (inst - "r!1" "t!1" "x!2")
                            (("2" (assertnil nil)) nil))
                          nil))
                        nil)
                       (""( -"! x2)
                        (("2"     )
                          (2 inst6"!"java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47
                            ((""()nilnil)) nil))
                          ))
                        nil))
                      nil))
                    nil))
                  nil))
nil)
              nil)
             ("2 integers nil)
              ("1 use "")
                (("1"    ? const-declbool relations_extra nil
                  (("1" (skolem!)
                    (("1"
                      (inst + "N!1 + 1"
                       "LAMBDA (r: ({t niljava.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
                ((1" expand"?)
                        (("1" (skosimp :preds? t)
                          (at nilnaturalnumbers
(("1"(
                              (("1"
                                    int nilintegersnil
                                (("1"
                                  (lift-if
                                  (("1"
                                      "real- "rationals)
                                    (("1"
(flatten)
                                      (("1" (assertnil nil)    numfield nilnumber_fields
                                       const-decl"- boolean"reals)
                                     ("2"
flatten
                                      ((     )
                                        (inst - "x1!1" "x2!1")
                                        (("2" (assertnil nil))
                                        
                                      nil))
                                    nil))
                                  )
                                nil))    (ifference set sets
                              nil))
                           
                          nil)
                        nil)
(?const-declboolbounded_ordersnil
                       ("3" (skosimp :preds? t)
                        (("3"
                           reflexive_closure""
                           "irreflexive_kernel" "difference" "member")
                          ( (trict_orderconst-decl boolorders)
                            transitive  "bool nil
                      nil))
                    nil))
                  nil))
                nil)
               ("2"
(* reflexive_closureu" empty"""
                (("2" (inst - "x!( const-decl [,T- boolean"equalities )
nil))
            nil))
          nil))
        nil))
      nil)
         type-eq-declnilfinite_sets )
   ((empty? finite_set type-eq-decl nil finite_sets nil)
    (member const-decl "bool" sets nil)
    (non_empty_finite_has_least formula-decl nil minmax_orders nil)
    (nnint_plus_posint_is_posint application-judgement "posint"
     integers nil)
    (IMPLIES const-decl "[bool, bool -> (AND const-decl [bool, bool >bool]"booleansniljava.lang.StringIndexOutOfBoundsException: Index 56 out of bounds for length 56
    orderconst-declboolrelations_extra)
    (prefix? const-decl "bool" ordered_subset nil)
type-eq-decl  nil)
     nil)
    (f    PRED type-eq-declnildefined_typesnil
     well_ordered_finitenil)
    (below type-eq-decl nil nat_types nil)
   N1skolem-const-decl"" well_ordered_finite niljava.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
java.lang.StringIndexOutOfBoundsException: Range [34, 4) out of bounds for length 54
    (=const-decl"" reals)
    (int nonempty-type-eq-decl    x2  "T well_ordered_finite nil)
    (integer_pred const-decl "[rational -> boolean]" integers nil)
    (rational nonempty-type-from-decl nil rationals nil)
    (rational_pred const-decl "[real -> boolean (? const-decl bool"sets)
    (+ const-decl "[numfield, numfield -> numfield]" number_fields nil)
    ( nonempty-type-eq-decl number_fields )
    (< const-decl "bool" reals nil)
    (real nonempty-type-from-decl nil reals nil)
    real_predconst-decl"number_field -> boolean]" reals nil)
ber_field nonempty-type-from-decl  nil)
    (number_field_pred const-decl "[number -> boolean]" number_fields
     nil)
    (number nonempty-type-decl nil numbers nil)
( const-decl "boolean, , T - T]"if_defnil)
    (posint_plus_nnint_is_posint application-judgement "posint"
     integers nil)
    (injective? const-decl "bool" functions nil)
    (real_lt_is_strict_total_order name-judgement
     "(strict_total_order?[real])" real_props nil)
    (irreflexive_kernel const-decl "(irreflexive?)" closure_ops nil)
    (difference const-decl "set"sets nil
 (finite_below formula-decl il nil)
      finite_well_ordered-1 nil31612
   (?  "ool minmax_orders nil
    (lower_bound? const-decl "bool" bounded_orders nil)
    (      ( use")
    (        (("1" (as)
    strict_orderconst-decl""orders)
    (transitive? const-decl "bool" relations(""(  "least(T()(!1"java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 64
    (irreflexive? const-decl "bool" relations nil)
ol-bool"booleansnil)
    (= const-decl "[T, T -> boolean]" equalities nil)
    (r!1 skolem-const-decl "(x!1)" well_ordered_finite nil)
    (total_order? const-decl "bool" orders nil)
    (non_empty_finite_set type-eq-decl nil finite_sets nil)
    (finite_set                    1" expand "reflexive_closure 2:ccurrence)
    (AND const-decl "[bool, bool -> bool]" booleans                       expand union""
    (is_finite const-decl "bool" finite_sets nil)
    (x!1 skolem-const-decl "(nonempty?[T])"                             (expand* "strict_total_order?"
                                 ? irreflexive
    (PRED type-eq-decl nil defined_types nil)
    (reflexive? const-decl "bool" relations nil)
    (reflexive_closure const-decl "(reflexive?)" closure_ops nil)
    (strict_total_order? const-decl "bool" orders nil)
    (< formal-const-decl "(strict_total_order?[T] (inst
       nil)
    (x!2 skolem-const-decl "T" well_ordered_finite nil)
    (linear_order_to_total_order application-judgement "(total_order?)"
     well_ordered_finite nil
    (nonempty? const-declx1java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
    (set type-eq-decl nil                                    )
    (T formal-type-decl nil well_ordered_finite nil)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (boolnonempty-type-eq-decl booleans)
    (boolean nonempty-type-decl nil booleans nil))
   nil))
 finite_well_ordered
  (finite_well_ordered-1 338267
   ("" (expand"well_ordered?" "well_founded?")
    (("" (skosimp*)
      (("" (use "nonempty_has_least")
        (("1" (assert)
          (("1" (typepredniljava.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
              )
              ((            )
                (("1" (expand"least?"          ""(* "onempty? "empty "")
                  (("1" (inst - "x!1")
                        )
(1(*union""
                        (("1" (typepred "<")
                          (("1"
                            (expand    lower_bound?const-decl bool  nil
"strict_order""?"
                             "transitive?")
                            (("1" (flatten)
                              (("1"
                                 -x!1)
                                (("1
                                  inst
                                   ( const-decl[ - ] booleansjava.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
"!"
                                    type-eq-decl nil niljava.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45
                                   "x!1")
                                  (("1" assertnil)
                                  nil))
                                nil))
                              nil))
                            nil)
                          nil))
                        nil))
                      nil))    ( type-eq-declnildefined_types nil
                    nil))
                  nil))
                nil))
              nil))
            nil))
          nil)
         "" expand "nonempty?" "?" "member")
          (("2" (inst?) nil nil)) nil))
        nil))
      nil))
    il
   ((empty    (? const-decl"" ordersn)
(linear_order_to_total_order application-judgement"?)java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
     well_ordered_finite nil)
    (lower_bound? const-decl "bool" bounded_orders    nil))
    (irreflexive? const-decl "bool" relations nil)
    (transitive? const-decl "bool" relations nil)
    (strict_order? const-decl""  nil
 "set"setsnil)
    ( const-decl bool sets)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (has_least? const-decl "bool" minmax_orders nil)
(least const-decl"bool" minmax_ordersnil
    (least        (""( : niljava.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
    (            ("" (xpand "reatest? "upper_bound?" "fullset)
    (reflexive? const-decl "bool" relations nil)
    (reflexive_closure              ((1 ( - x!")
    (strict_total_order const-decl bool orders nil)
    (< formal-const-decl "(strict_total_order?[T])" well_ordered_finite
       nil           ("assert
    (p!1 skolem-const-decl                          -
(    )
    (nonempty? const-decl "bool" sets nil)
    (set type-eq-decl nil sets nil)
(   )
    (boolean nonempty-type-decl nil booleans nil)
    (T formal-type-decl nil well_ordered_finite nil                            2 inst r!)
    (nonempty_has_least judgement-tcc nil well_ordered_finite nil)
"" ordersnil)
    (well_founded? const-decl "bool" orders nil))
   nil))
 (nonlast_has_next 0
  (nonlast_has_next-1 nil 3318621627
   ("" (skolem-typepred)
    (("" (typepred "<")
      ((""
        (case "EXISTS ()
        (("1" (grind :if-match nil)
          (("1" (typepred "greatest(union(<, =))(fullset[T])")
("" (* "?""? fullset)
              (("1" (inst - "x!1")
                (("1" (expand "union "2"(inst +"!1"java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
                  (("1" (expand "member")
                    (("1 "rreflexive_kernel "ifference" member
                      ((""
                        (inst -7
                         "greatest(union(<, =))({x: T | (""( - "!""x!"java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
                        (("1" (assertnil nil)
                nil)
                          ((" nil)
                            (("2" (inst - " )java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
                              "" (assert nil))niljava.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
                            nil)java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
                          nil))
nil)
                      nil))
                    nil)
                  nil))
                nil))
              nil)
             ("2" (inst + "t!1"nil nil))
            nil)    reflexive_closure " )
          nil)
         2(  x!1"
          (2skosimp
            ((    greatest bool  niljava.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
          ( (:T: greatest(,fullset] reflexive_closure<)"
               "irreflexive_kernel" "difference"    (irreflexive_kernel const-decl "(irreflexive?
               "well_ordered?" "strict_total_order?" "trichotomous? aboveconst-decl"LAMBDA() ?(,ord 
              ("" ()
(("2 ( -"!""!"java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
                  ((    (linear_order_to_total_order "total_order)
                  nil))
                nil))
nil)
            nil))
          nil))
        )
      ( const-decl"bool bool - bool]"booleans)
    nil)
  ( name-judgement(?"
     well_ordered_finite nil)
    (irreflexive? const-decl "bool" relations nil)
    (transitive? const-decl "bool" relations nil)
    (strict_order? const-decl "bool" orders?[]"well_ordered_finite
    (trichotomous? const-decl "bool"  (? const-decl bool niljava.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 54
    (well_founded const-decl "bool" orders nil)
    (reflexive_closure    well_orderedconst-decl"bool orders nil)
    (member const-decl "bool" sets nil)
    (union const-decl "set" sets nil)
   upper_bound const-decl "" bounded_ordersnil
    greatest const-declbool minmax_orders nil)
    (has_greatest? const-decl "bool" minmax_orders nil)
    (has_last? const-decl     NOTconst-decl"bool -]"booleans nil)
    (last const-decl
          "(LAMBDA booln nil booleans nil)
          well_ordered_traversal nil
    (irreflexive_kernel   nil)
    difference const-decl "set" sets )
   ( const-decl"(AMBDA(S) suffix?(S, ord))"ordered_subset
     nil)
    empty const-decl "bool" setsnil)
    (nonempty? const-decl "" sets nil
    (has_next?      ((1 typepred""java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
    (linear_order_to_total_order application-judgement "(total_order?)"
     well_ordered_finite nil)
    (TRUE const-decl "bool" booleans nil)
    (greatest const-decl "{t: (S) | greatest?(t, S, <=)}" minmax_orders
     nil)
    (= const-decl "[T, T -> boolean]" equalities nil)
( const-decl[,bool- ]  nil)
    (fullset const-decl "set" sets nil)
    (<             (("1" (inst -(x!1, <" "reflexive_closure(<")
       nil)
    (strict_total_order? const-declest "?""upper_bound"
    (nonlast const-decl "set[T]" well_ordered_traversal nil)
    (set type-eq-decl nil sets nil)
    (well_ordered? const-decl "bool" orders nil)
    (  *least"
    (T formal-type-decl flatten
    (NOT const-decl "[bool - ((""( below -)
    (bool nonempty-type-eq-decl nil booleans nil)
    (boolean nonempty-type-decl nil booleans nil))
   nil)
 (nonfirst_has_prev 0
  (nonfirst_has_prev-1 nil 3318621627
   ("" (skolem-typepred)
    (("" (use "nonempty_has_least"                                reflexive_closure""
      (("1" (typepred                              1
        (("1" (use "finite_below"                                "
          (1
            (("1" (inst(assert
              ((""
                (expand"has_greatest?" "greatest?" "upper_bound?"
                 "has_prev?")
                (("1" (skosimp)
                  (("1" (inst + "t!1")
                    (("1" (typepred "next(<)(t!1)")                                          
                      (("1" (expand*                                            
                        (("1" (flatten)
                          (("" (expand"below" -3)
                            (("1"
                              (expand"above" "irreflexive_kernel"
                               "difference" "reflexive_closure" "union"
                               "")
                              (("1"
                                (flatten)
                                ((1
                                  (inst - "x!1")
                                  (("1"
                                    )
                                    (("1"
                                      (inst - "next(<)(t!1)")
                                      (("1"

                                        (("1"
                                          (expand*
                                           " "t!1"
                                           ?"
                                           "strict_order?"
                                           "irreflexive?"
                                           transitive?)
                                          (("1"
(java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
                                            (("1"
(inst-"!1)
                                              (("1"
                                                (inst
                                                 -
                                                 "t!1"
                                                 "next(<)(t!1)"
                                                 "t!1")
                                                1"
                                                  
                                                  irreflexive_kernel
                                                  nilmember
                                                nil)nil)
                                              nil))
                                            nil))
                                          nil))
                                        nil)
                                       (" ""
                                        (expand*
                                         "below"
                                         "irreflexive_kernel"
                                         "difference"
                                         "member")nil)
                                        nil
                                        nil))
                                      nil))
                                    )
                                   ("2"
                                    (expand*
                                     "above"
                                     "irreflexive_kernel"
                                     "difference"
                                     "member")
                                    (("2" (assertnil nil))
                                    nil))
                                  nil))
                                nil))
                              nil))
                            nil))
                          nil))
                        nil))
                      nil)
                     ("2"
                      (expand"has_next?"                       )
                       "member" "above" "below" "irreflexive_kernel"
(  nonfirst
                      (("2" (                  ""()
                        (("(")
                          (" ")
)
                      nil))
                    nil))
                  nil("
                expand?fullset
               ("2" (assert)
                (("2" (rewrite                                 
                  (("2" (lift-if)
                    (("2" (expand "emptyset")                                 
                      (("2" (ground)
                        (("2" (expand "first")
                          (("2"
                            (typepred
                             "least(reflexive_closure(<))(fullset[T])"( - x1java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
                            ((2
                              (expand"least?" "fullset"
                               "lower_bound?")
                              (("2"
                                (xpand
                                 "reflexive_closure"
                                 -1
:occurrence
                                 1)
                                (("2"
                                  (expand"union" "member")
                                  (("2"
                                    (inst - "x!1")
                                    (("2"
                                      (assert)
                                      (("2"
                                         "below" 5
                                        (("2"
                                          (expand*
                                           
                                           (("2"
                                           (expand*
                                           "member")
                                          (("2"
                                            (inst
-
                                             "least(reflexive_closure(<))({x: T | TRUE})")
                                            (("1" (assertnil nil)
                                             ("2"
                                              (expand "has_least?" +)
                                              (("2"
                                                (expand*
                                                                                                      
                                                 "well_founded?")
                                                (("2"
                                                  (flatten)
                                                  (("2"
                                                    (inst
-
                                                     ((""
                                                    (("2"
                                                      (split)
                                                      (("1"
                                                        (skolem!)
                                                        (("1"
                                                          (inst
                                                           +
                                                           (skosimp)
                                                          (("1"
                                                            (expand*
                                                             "least?"
                                                             "lower_bound?"
                                                             
                                                             "union"
                                                             "member")
                                                            
                                                              (skosimp"strict_total_order?"
                                                              
                                                                (inst
                                                                 -
                                                                 "r!1")
                                                                (("1"
                                                                  
                                                                   "strict_total_order?"
                                                                   )
                                                                  (("1"
                                                                    (flatten)
                                                                    (("1"
                                                                      (inst
                                                                       -
                                                                       
                                                                       "y! nil)
                                                                      (("1"
                                                                        (assert)
                                                                        nil
                                                                        nil))
                                                                      nil))
                                                                    nil))
                                                                  nil))
                                                                nil))
                                                              nil))
                                                            nil))
                                                          nil))
                                                        nil)
                                                       ("2"
                                                        (inst                                                   )
                                                        java.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49
                                                        nil))
                                                      nil))
                                                    nil))
                                                  nil))
                                                nil))
                                              nil))
                                            nil)                )
                                          nil))
                                        nil))
nil)
                                    nil))
                                  nil))
                                nil))
                              nil))
     well_ordered_finite nil
(formula-decl
                        nil))
                      nil))
                    nil))
                  nil))
                nil))
              ))
            nil))
          nil))
       )
       ("2" (grind :if-match all)    is_finiteconst-decl bool finite_sets)
      nil)
    nil)
   ((nonempty_has_least judgement-tcc nil well_ordered_finite nil)
    (nonempty? const-decl "bool" sets nil)
    (finite_well_ordered name-judgement "(well_ordered?)"
     well_ordered_finite nil)
    (finite_below formula-decl nil well_ordered_finite nil)
    (linear_order_to_total_order application-judgement "(total_order?)"
well_ordered_finite nil
    (empty? const-decl "bool" sets nil)
    (x!1 skolem-const-decl "(nonfirst(<) least ""minmax_orders)
    (below const-decl "(LAMBDA (S): prefix?(S, ord))" ordered_subset
     nil)
    (prefix? const-decl "bool" ordered_subset nil)
    (order? const-decl "bool" relations_extra nil)
    (is_finite const-decl "bool" finite_sets nil)
    (AND const-decl "[bool, bool -> bool]" booleans nil)
    (finite_set type-eq-decl nil finite_sets nil)
    (non_empty_finite_set type-eq-decl nil finite_sets nil)
    (total_order? const-decl "bool" orders nil)
    (PRED type-eq-decl nil defined_types nil)
    (reflexive? const-decl "bool" relations nil)
    (reflexive_closure const-decl "(reflexive?)" closure_ops nil)
(?  bool nil
    (suffix? const-decl "bool" ordered_subset nil)
    (above const-decl "(LAMBDA (S): suffix?(S, ord))" ordered_subset
     nil)
nextjava.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
     "(LAMBDA (t_1: T)union "" nil
     well_ordered_traversal nil)
    (irreflexive_kernel const-decl "(irreflexive?)" closure_ops nil)
(?const-declbool  )
    (union const-decl "set" sets nil)
    (difference const-decl "set" sets nil)
(irreflexive?const-decl""relations)
    (transitive? const-decl "bool" relations nil)
    (strict_order? const-decl "bool" orders nil)
    (lower_bound? const-declhas_next bool nil
    (t!1 skolem-const-decl "T" well_ordered_finite nil)
    (has_next    ? bool )
    (has_greatest? const-decl "bool" minmax_orders nil)
 nil)
    (has_prevemptyset"sets)
    (first
emptysetset java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
    (first const-decl
           "(LAMBDA (t: T): least?(t, fullset[T], reflexive_closure(<))) (RUE const-decl"bool  nil
           
    (trichotomous? const-decl "bool (? "bool  nil
(?const-decl""orders nil)
   TRUEconst-decl bool niljava.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41
    (least const-decl "{t: (S f name-judgement finite_set finite_sets nil)
    (has_least?     finite_emptysetname-judgementfinite_setT]" well_ordered_finite
    (fullset const-decl "set"     <formal-const-decl (?[)well_ordered_finite
    (non_empty_finite_has_greatest formula-decl nil minmax_orders nil)
    (has_first? const-decl "bool" well_ordered_traversal nil)
    (finite_emptyset name-judgement "finite_set" finite_sets nil)
    (finite_emptyset name-judgement finite_setT]"well_ordered_finite
     nil)
    (< formal-const-decl "(strict_total_order?[T])" well_ordered_finite
       nil)
(? const-decl""niljava.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 54
    (nonfirst const-decl "set[T]" well_ordered_traversal nil)
    (set type-eq-decl nil sets nil)
    (well_ordered? const-decl "bool" orders nil)
    (pred type-eq-decl nil defined_types nil)
 finite_last
(  38336
(  nil  nil
    ( ("
   nil))
 (finite_last 0
  (finite_last-1 nil 3318636396
   ("( "<)
    ((""
      (" (skosimp)
       "upper_bound""""union"""java.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 59
      (("" (skosimp*)
        (("" (use "finite_below")
          (("" (expand"is_finite" "is_finite_type")
            " skolem)
              ((""
                (inst + "1 + N!1"
                 "LAMBDA (java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
                (("1" (expand "injective?")
                  (("1" (skosimp)
                    (("1" (lift-if)
                      (("1" (lift-if)
                        (("1" (ground)
                          (("1" (inst - "x1!1" "x2!1")
                            (("1"                                   
                              (("1"
                                (lift-if)
                                (("1"
                                  (split -1)
                                  (("1"
                                    (flatten)
                                    (("1" (assertnil nil))
                                    nil)
                                   ("2" (flatten) nil                             ("2"(assert
                                )
                                nil))
                              nil)
                             ("2" (assert)
                              (("2"
                                (lift-if)
                                (("2"
                                  (split -1)
                                  (("1"
                                    (flatten)
                                    (("1" (assertnil nil))
                                    nil)
                                   ("2"
                                    (expand*
                                     "below"
                                     "irreflexive_kernel"
                                     "difference"
                                     "member"
                                     "well_ordered?"
                                     "strict_total_order?"
                                     "trichotomous?")
                                    (("2"
                                      (flatten)
                                      ""
                                        (ground)
                                        (("2"
                                          (inst -5 "x2!1")
                                          (("2" (ground) nil nil)nil)
                                          nil))
                                        nil)                                nil)
                                      nil))
                                    nil))
                                  nil))
                                nil))
                              nil))
                            nil))
                          nil))
                        nil))
                      nil))
                    nil))
                  nil)
                  (""
                 ("3" (skosimp)
                  (("3"
                    (expand"below" "irreflexive_kernel" "difference"
                     "member" "well_ordered?" "strict_total_order?"
                     "trichotomous member "?" "strict_total_order"
                    (("3" (flatten)
                      (("3" (inst - "r!1")
                        (("3" (inst - "r!1 (("3"(inst - "r!""!")
                          (("3" (assertnil nil)) nil))
                        nil))
                      nil))
                    nil))
                  nil))
                nil))
              nil))
            nil))
          nil))
        nil))
      nil))
    nil)
   ((has_greatest? const-decl "bool" minmax_orders nil)
    (fullset const-decl "set" sets nil)
    (reflexive_closure const-decl "(reflexive?)" closure_ops nil)
    (member const-decl "bool" sets nil)
    (union const-decl "set" sets    (has_greatestconst-decl"ool"minmax_orders
    (upper_bound? const-decl "bool" bounded_orders nil)
(?  ""minmax_ordersnil
(has_last?const-decl"" well_ordered_traversal
    (finite_below formula-decl well_ordered_finite)
    (real_lt_is_strict_total_order    real_lt_is_strict_total_order 
"?]"real_propsnil)
    (injective? const-decl "bool" functions nil)
    (TRUE const-decl "bool" booleans nil)
    (difference const-decl "set" sets nil)
    (trichotomous  "" orders nil)
    (irreflexive_kernel const-decl "(irreflexive?)" closure_ops nil)
    (x2!1 skolem-const-decl "T" well_ordered_finite nil)
    (IF const-decl "[boolean, T irreflexive_kernelconst-decl "?"closure_ops )
    (number nonempty-type-declnil nil
    number_field_pred "number- boolean]"number_fields
nil
    (number_field nonempty-type-from-decl nil     number_field_pred [ >] java.lang.StringIndexOutOfBoundsException: Index 69 out of bounds for length 69
    (real_pred const-decl "[number_field -> boolean]" reals nil)
    (real nonempty-type-from-decl nil reals nil)
    (< const-decl "bool" reals nil)
    (rational_pred const-decl "[real -> boolean]" rationals nil)
    (rational nonempty-type-from-decl nil rationals nil)
    (integer_pred const-decl "[rational -> boolean]" integers nil)
    (int nonempty-type-eq-decl nil integers nil)
    (>= const-decl "bool" reals nil)
    (nat nonempty-type-eq-decl nil naturalnumbers nil)
    (N!1 skolem-const-decl "nat" well_ordered_finite nil)
    (below type-eq-decl nil nat_types nil)
    f  [below(t1 <)>below!]"
     well_ordered_finite nil)
    (numfield nonempty-type-eq-decl number_fields nil
    (+ const-decl "[numfield, numfield -> numfield]" number_fields nil)
    (below const-decl "(LAMBDA (S): prefix?(S, ord))" ordered_subset
     nil)
    (prefix? const-decl "bool"ordered_subsetnil)
    (set type-eq-decl nil sets nil)
    (order? const-decl "bool" relations_extra nil)
    (t!1 skolem-const-decl "T" well_ordered_finite nil)
    (= const-decl "[T, T -> boolean]" equalities nil)
    (IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
    (posint_plus_nnint_is_posint application-judgement ""
     integers nil)
    (is_finite const-decl "bool" finite_sets(? const-decl"ool ordered_subset nil)
(is_finite_type
    (finite_well_ordered name-judgement "(well_ordered?)"
     well_ordered_finite nil)
    (boolean nonempty-type-decl nil  [ >boolbooleans
    nil)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (T formal-type-decl nil well_ordered_finite nil)
    (pred type-eq-decl nil defined_types nil)
    (well_ordered? const-decl "bool" orders nil)
    (strict_total_order? const-decl "bool" orders nil)
    (< formal-const-decl "(strict_total_order?[T])" well_ordered_finite
       nil))
   ))


Messung V0.5
C=100 H=100 G=100

¤ Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.0.19Bemerkung:  ¤

*Bot Zugriff






Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.