(prelude_sets_aux
(complement_difference 0
(complement_difference-1 nil 3293875050
("" (skolem 1 ("A" "B" ))
(("" (rewrite "difference_intersection" )
(("" (rewrite "demorgan2" )
(("" (rewrite "complement_complement" ) nil nil )) nil ))
nil ))
nil )
((difference_intersection formula-decl nil sets_lemmas nil )
(boolean nonempty-type-decl nil booleans nil )
(bool nonempty-type-eq-decl nil booleans nil )
(set type-eq-decl nil sets nil )
(T formal-type-decl nil prelude_sets_aux nil )
(complement_complement formula-decl nil sets_lemmas nil )
(complement const-decl "set" sets nil )
(demorgan2 formula-decl nil sets_lemmas nil ))
shostak))
(Intersection_member 0
(Intersection_member-1 nil 3293730468 ("" (grind) nil nil )
((Intersection const-decl "set" sets nil )
(member const-decl "bool" sets nil ))
shostak))
(Intersection_split 0
(Intersection_split-1 nil 3293730569
("" (skosimp*)
(("" (apply-extensionality 1 :hide? t)
(("" (lemma "Intersection_member" ("x" "x!1" ))
(("" (inst-cp - "A!1" )
(("" (expand "intersection" )
(("" (expand "member" )
(("" (inst - "rest(A!1)" )
(("" (case-replace (prelude_sets_aux
(("1" (simplify -3)
(("1" (flatten)
(("1" (hide -2)
(("1" (split -2)
(("1" (inst - "choose(A!1)" )
(("1" (assert ) nil nil )) nil )
("2" (hide 2)
(("2" (skosimp*)
(("2"
(typepred "a!1" )
(("2"
(lemma "rest_subset" ("a" "A!1" ))
(("2"
(expand "subset?" )
(("2"
(expand "member" )
(("2"
(inst - "a!1" )
(("2"
(assert )
(("2"
a1)
nil
nil ))
nil ))
nil ))
))
)
nil ))
))
nil ))
nil ))
nil ))
nil ))
nil ))
)
("2" (assert boolnonempty-type-eq-declnil booleans)
tten)
(("2" (replace -4)
(2" skosimp*java.lang.StringIndexOutOfBoundsException: Range [40, 41) out of bounds for length 40
((2 ( "chooseA1=!" java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 64
(2 assert java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
(("2"
- "1)
""
xpand"rest)
(("2"
(expand "nonempty?" )
(("( Intersection(A!1(x1" java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
(assert )
(("2 ((" "( 2java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
("" () nil ))
(("2"
(expand "member
(("2" (propax) nil nil ))
nil ))
nil ))
nil ))
)
nil ))
nil ))
))
nil ))
nil ))
nil )
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((T formal-type-decl nil prelude_sets_aux nil )
(boolean inst - "!1" )
(est const-decl"set" sets) chooseconst-decl"p" setsnil java.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
nonemptyconst-decl"bool" setsnil java.lang.StringIndexOutOfBoundsException: Range [42, 43) out of bounds for length 42
(ntersection "set )
(Intersection const-decl "set" nil )
(set type-eq-decl nil sets
(etofsets type-eq-decl sets nil )
(setof nil java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
(bool nonempty-type-eq-declnil )
)
"(surjective?[setofsets[T],nil)
member bool setsnil )
(rest_subset (2 flatten
(subset?const-declboolsets)
(NOT const-decl "[bool (" " (*)
( const-decl"" setsnil
(a!1 skolem-const-decl "()
(A!1 skolem-const-decl "setofsets[T]" prelude_sets_aux nil )
(= const-decl "[T, T -> boolean]" equalities nil )
Intersection_member nil nil )
shostak))
(Intersection_finite0
(Intersection_finite-1 nil 3293823392
(" skosimp*
(("" (name "N" "card(A!1)" )
("1"
(case "FORALL (A:setofsets[T],n:nat): subset?(A,A!1) & card(A) <= ((2"
(("1" (inst - "A! ((" "
(("1" (assert ) (("1" (rewrite "subset_reflexive" ) nil nil ))
nil ))
nil )
("2" (hide 2)
("" (induct "n" java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
(("1" (skosimp*)
((1 expand <"-)
(( java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45
(("1" (assert ) nil))
("2" (rewrite "card_is_0" -1)
(("1" (replace
(1 lemmaIntersection_empty_full"
("" hide-all-but
(("1" (rewrite "fullset_is_full?" )
((" nil))
nil ))
nil ))
nil )
("2" (lemma nil )
(("2" (assert ) nil nil )
nil (T formal-type-decl nil nil )
nil ))
nil )
nil )
"" (*)
(( ( const-decl"" nil )
(("2" (split -3)
(1 inst-"!2" (1 assert nil nil ) )
("" (lemma finite_subset("s" "!" A A1)
(("2" (assert )
(2 lemmanonempty_card "" A2)
(("2 nil)
("" (lemma card_rest"" "!2)java.lang.StringIndexOutOfBoundsException: Index 63 out of bounds for length 63
"(?[[T] setT]]" sets_lemmas)
(("1"
(lemma"" "" "!" )
(("1"
(lemma
subset_transitive
java.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
remove set sets)
b
"A!2"
"c"
A1)java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
(("1"
(assert
(("1"
"(A!))
java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
java.lang.StringIndexOutOfBoundsException: Range [48, 49) out of bounds for length 48
"1"
(lemma
"choose_member"
a" " A2")
(("1"
nil )
(("1 (2" ( )
(1"(expand " <" -)
(("1"
inst "hooseA!2" java.lang.StringIndexOutOfBoundsException: Index 70 out of bounds for length 70
(1 lemmaIntersection_empty_full])
(inst
-
((1 rewrite fullset_is_full)
"Intersection(rest(A!2))" )
(("1"
(assert )
)
(lemma
("A" "A!2" ))
(("1"
(assert )
)
nil ))
nil ))
nil ))
"2 A A1)
( "?" )
(("2"
-9
" (" " lemma" card_rest "" "!" )
(("2"
(expand "member" )
(("2"
(propax)
nil
nil ))((1
nil ))
"
nil ))
))
nil )
("2"
(expand "nonempty?" )(assert
() nil ))
nil ))
)
(1
nil ))
"choose_member
("a" "A2)
nil )
("2"
expand "?" )
(("2" (propax) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
nil java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
nil ))java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
nil ))
nil )
("" (ide
(("3" (skosimp*)
("" (finite_subset "" "!" "" "!" ))
(("3" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil )
hide 2
(("3" (skosimp*)
(3 lemma"finite_subset" (s A2 A"A!1" )
(("3" (assert ) nil nil )) nil ))
nil ))
nil ))
nil )
("2" (propax) nil nil ))
nil ))
nil )
((setofsets
cardconst-decl"n:nat| n =CardS)" finite_sets nil )
(Cardconst-decl "nat finite_sets nil)
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(int nonempty-type-eq-decl nil integers nil )
(nteger_predconst-decl "[ - ]" integersnil )
(rational nonempty-type-from-decl nil rationals nil )
(rational_pred const-decl "[real -> boolean]" rationals nil )
(real nonempty-type-from-decl nil reals nil )
(real_pred const-decl "[number_field -> boolean]" realsnil ))
(number_field nonempty-type-from-decl nil nil )
(number_field_pred const-decl "[number -> boolean]"
(finite_set type-eq-decl nil finite_sets nil )
(set type-eq-decl nil sets nil )
(setof type-eq-decl nil defined_types nil )
(bool nonempty-type-eq-decl nil booleans nil )
(T formal-type-decl nil prelude_sets_aux nil )
(= const-decl "[T, T -> boolean] (" "
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
(real_gt_is_strict_total_ordernil ))
"(strict_total_order?[real])" java.lang.StringIndexOutOfBoundsException: Range [54, 50) out of bounds for length 59
(subset_transitive formula-decl nil sets_lemmas nil )
(rest const-decl "set" sets nil )
(choose_member formula-decl nil sets_lemmas nil nil ))
(member const-decl "bool" setsnil
(Intersection_split formula-decl nil prelude_sets_aux nil )
(A (expand "onempty?)
(choose const-decl "(p)" sets nil nil )java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 51
(nonempty? ))
(int_minus_int_is_int application-judgement "int nil)java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45
(rest_subset formula-decl nil sets_lemmas nil )
(card_rest formula-decl nil finite_setsnil
(nonempty_card formula-declnil finite_setsnil )
(finite_subset formula-decl nil finite_sets nil )
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(fullset_is_full? formula-decl nil sets_lemmas nil )
(emptyset const-decl "set" sets nil )
(Intersection_empty_full formula-decl nil nil )java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
(finite_emptyset name-judgement "finite_set" finite_sets nil )
(card_is_0 formula-decl nil finite_sets nil )
(nat_induction formula-decl nil naturalnumbers )
(pred))
(A!1 skolem-const-decl "setofsets[T]" prelude_sets_aux nil )
(subset_reflexive formula-decl nil sets_lemmas nil )
(Intersection_surjective name-judgement
"(?[setofsetsT],setT]" sets_lemmas nil )
(subset_is_partial_order name-judgement "(partial_order?[set[T]])"
nil
(real_le_is_total_order name-judgement "(total_order?[realnil))
real_props nil )
( const-decl"bool bool - bool" nil
nil )
subset "bool" nil )
(<= const-decl "bool" reals nil )
(Intersection const-decl "set" sets nil (3" skosimp)
shostak
(Union_member 0
("()nilniljava.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
((Union const-decl "set" sets nil nil
(member const-decl "bool" sets nil ))
shostak))
(Union_split 0
(Union_split-1 nil 3293732078
( "n =Card()" finite_sets)
(("" (apply-extensionality 1 :hide? t)
(" expand" "java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
(("" (> "bool reals nil)
(("" (lemma "Union_member" ("x" "x( const-decl " - ] nil
(("" (expand "member" )
("( " UnionA!1(!)")
( real nil nil )
("" (!java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33
(("1 ( const-decl [ >boolean" number_fields
(("1" (assert ) nil nil )
("2" (flatten 2)
(("2" (replace -2 3)
(("2" (inst + "a!1" )
(("2" (expand "rest" )
(("2"
(expand "nonempty?" )
(("2"
(assert )
(("2"
(expand "remove" )
(("2"
(expand "member" )
(("2" (propax) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (assert )
(("2" (split -2)
(("1" (inst + "choose(A!1)" ) nil nil )
("2" (assert )
(("2" (skolem!)
(("2" (typepred "a!1" )
(("2" (lemma "rest_subset" ("a" "A!1" ))
("" (expand subset"
( "" )
(expand "member" )
((""
(inst - "a!1" )
(""
=const-declT- ] nil java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
real_gt_is_strict_total_orderjava.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49
java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41
nil ))
nil )
nil ( n )
nil ))
nil ))
int_minus_int_is_int int java.lang.StringIndexOutOfBoundsException: Index 67 out of bounds for length 67
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((T formal-type-decl nil prelude_sets_aux nil )
(boolean nonempty-type-decl nil booleans nil )
(rest const-decl "set" sets nil ) (choose const-decl "(p)" sets nil )
(nonempty? const-decl "bool" sets nil )
(union const-decl "set" sets nil ) (Union const-decl "set" sets nil )
(set type-eq-decl nil sets nil )
(setofsets type-eq-decl nil sets nil )
(setof type-eq-decl nil defined_types nil )
(bool nonempty-type-eq-decl nil booleans nil )
(Union_surjective name-judgement
"(surjective?[setofsets[T], set[T]])" sets_lemmas nil )
(Union_member formula-decl nil prelude_sets_aux nil )
(member const-decl "bool" sets nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(subset? const-decl "bool" sets nil )
(rest_subset formula-decl nil sets_lemmas nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(remove const-decl "set" sets nil )
(a!1 skolem-const-decl "(A!1)" prelude_sets_aux nil )
(A!1 skolem-const-decl "setofsets[T]" prelude_sets_aux nil ))
shostak))
(Union_finite 0
(Union_finite-1 nil 3293825830
("" (skosimp*)
(("" (lemma "Intersection_finite" )
((""
(inst - "Complement(A!1)"
"lambda (x:set[T]): P!1(complement(x))" )
(("" (rewrite "Demorgan2" -1)
(("" (rewrite "Complement_Complement" )
(("" (rewrite "complement_fullset" -1)
(("" (replace -2)
(("" (split -1)
(("1" (propax) nil nil )
("2" (hide-all-but (-2 1))
(("2" (expand "is_finite" )
(("2" (skolem!)
(("2"
(inst + "N!1"
"lambda (a:(Complement(A!1))): f!1(complement(a))" )
(("1" (expand "injective?" )
(("1" (skosimp*)
(("1"
(typepred "x1!1" )
(("1"
(typepred "x2!1" )
(("1"
(expand "Complement" )
(("1"
(skosimp*)
(("1"
(replace -1)
(("1"
(replace -2)
(("1"
(rewrite
"complement_complement" )
(("1"
(rewrite
"complement_complement" )
(("1"
(typepred "b!1" )
(("1"
(typepred "b!2" )
(("1"
(inst
-
"b!2"
"b!1" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide -1)
(("2" (skolem!)
(("2"
(typepred "a!1" )
(("2"
(expand "Complement" )
(("2"
(skolem!)
(("2"
(typepred "b!1" )
(("2"
(replace -2)
(("2"
(rewrite
"complement_complement" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (hide-all-but (1 -3))
(("3" (skosimp*)
(("3" (typepred "a!1" )
(("3" (expand "Complement" )
(("3" (skolem!)
(("3" (typepred "b!1" )
(("3"
(inst - "b!1" )
(("3"
(replace -2)
(("3"
(rewrite "complement_complement" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4" (hide-all-but (1 -4))
(("4" (skosimp*)
(("4"
(inst - "complement(a!1)" "complement(b!1)" )
(("4" (assert )
(("4" (rewrite "demorgan2" 1) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((Intersection_finite formula-decl nil prelude_sets_aux nil )
(Demorgan2 formula-decl nil sets_lemmas nil )
(Complement_bijective name-judgement
"(bijective?[setofsets[T], setofsets[T]])" sets_lemmas nil )
(Union_surjective name-judgement
"(surjective?[setofsets[T], set[T]])" sets_lemmas nil )
(complement_fullset formula-decl nil sets_lemmas nil )
(finite_emptyset name-judgement "finite_set" finite_sets nil )
(is_finite const-decl "bool" finite_sets nil )
(A!1 skolem-const-decl "setofsets[T]" prelude_sets_aux nil )
(number nonempty-type-decl nil numbers nil )
(number_field_pred const-decl "[number -> boolean]" number_fields
nil )
(number_field nonempty-type-from-decl nil number_fields nil )
(real_pred const-decl "[number_field -> boolean]" reals nil )
(real nonempty-type-from-decl nil 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 )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil )
(complement_complement formula-decl nil sets_lemmas nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(injective? const-decl "bool" functions nil )
(demorgan2 formula-decl nil sets_lemmas nil )
(Complement_Complement formula-decl nil sets_lemmas nil )
(complement const-decl "set" sets nil )
(set type-eq-decl nil sets nil )
(Complement const-decl "setofsets[T]" sets_lemmas nil )
(setofsets type-eq-decl nil sets nil )
(setof type-eq-decl nil defined_types nil )
(bool nonempty-type-eq-decl nil booleans nil )
(boolean nonempty-type-decl nil booleans nil )
(T formal-type-decl nil prelude_sets_aux nil ))
shostak))
(finite_Complement 0
(finite_Complement-1 nil 3293865693
("" (skosimp*)
(("" (typepred "F!1" )
(("" (name "N" "card(F!1)" )
(("" (case-replace "N=0" )
(("1" (rewrite "card_is_0" -2)
(("1" (replace -2)
(("1" (hide -2 -3 -1) (("1" (assert ) nil nil )) nil ))
nil ))
nil )
("2" (expand "is_finite" )
(("2" (skosimp*)
(("2"
(inst + "N!1"
"lambda (a:(Complement(F!1))): f!1(complement(a))" )
(("1" (hide -1 1)
(("1" (expand "injective?" )
(("1" (skosimp*)
(("1"
(inst - "complement(x1!1)" "complement(x2!1)" )
(("1" (assert )
(("1" (rewrite "complement_equal" ) nil nil ))
nil )
("2" (typepred "x2!1" )
(("2" (expand "Complement" )
(("2" (skolem!)
(("2"
(replace -1)
(("2"
(rewrite "complement_complement" )
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (typepred "x1!1" )
(("3" (expand "Complement" )
(("3" (skolem!)
(("3"
(replace -1)
(("3"
(rewrite "complement_complement" )
(("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide-all-but 1)
(("2" (grind)
(("2" (rewrite "complement_complement" ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((finite_set type-eq-decl nil finite_sets nil )
(is_finite const-decl "bool" finite_sets nil )
(set type-eq-decl nil sets nil )
(T formal-type-decl nil prelude_sets_aux nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(bool nonempty-type-eq-decl nil booleans nil )
(boolean nonempty-type-decl nil booleans nil )
(Complement_bijective name-judgement
"(bijective?[setofsets[T], setofsets[T]])" sets_lemmas nil )
(Complement_is_finite application-judgement "finite_set[set[T]]"
finite_sets_of_sets nil )
(finite_emptyset name-judgement "finite_set" finite_sets nil )
(card_is_0 formula-decl nil finite_sets nil )
(complement_complement formula-decl nil sets_lemmas nil )
(complement_equal formula-decl nil sets_lemmas nil )
(injective? const-decl "bool" functions nil )
(below type-eq-decl nil nat_types nil )
(< const-decl "bool" reals nil )
(complement const-decl "set" sets nil )
(F!1 skolem-const-decl "finite_set[set[T]]" prelude_sets_aux nil )
(Complement const-decl "setofsets[T]" sets_lemmas nil )
(setofsets type-eq-decl nil sets nil )
(setof type-eq-decl nil defined_types nil )
(number nonempty-type-decl nil numbers nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(number_field_pred const-decl "[number -> boolean]" number_fields
nil )
(number_field nonempty-type-from-decl nil number_fields nil )
(real_pred const-decl "[number_field -> boolean]" reals nil )
(real nonempty-type-from-decl nil 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 )
(Card const-decl "nat" finite_sets nil )
(card const-decl "{n: nat | n = Card(S)}" finite_sets nil ))
shostak)))
Messung V0.5 C=100 H=100 G=100
¤ Dauer der Verarbeitung: 0.15 Sekunden
¤
*© Formatika GbR, Deutschland