java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17nil java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45"!" java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58nil " nil) nil ))nil nil java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37nil sets_lemmas nil )nil booleans nil nil nil nil )set type-eq-decl nil (("2" (fla"" (*nil sets_lemmas nil )"set" sets nil )nil sets_lemmas nil ))nil 3293730468 ("" (grind) nil nil )"set" sets nil )"bool" sets nil ))nil 3293730569"" (skosimp*)"" (apply-extensionality 1 "" (ase-replace"choose(!)a1) "" (lemma " (" "() "" (inst-cp - "A!1" )"" (expand (insta!" "" (inst - "rest(A!1 " "java.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49 " case-replace" Intersection!)x!))"1" (simplify -3)"1" (flatten)"1" (hide -2)"1 split-) "1" (inst - "choose(A!1)" )assert nil ))nil )"2" (hide 2)th 44"2" "a!1" )nil )"2" expand "subset? il)) "2" 9"1) "2" "set nil) ( () nil) "2" "bool sets nil) nil "setsnil) nil )nil ))nil ))nil ))nil ))nil setsnil nil ))nil )nil )nil ))nil " ( const-decl" "sets nil) "" ()"" nil "skosimp*) "2" remove set )"2 assert "2" "a!java.lang.StringIndexOutOfBoundsException: Index 63 out of bounds for length 63 expand 0"(* expand "nonempty?" (1" assert )3expand "remove" )"2" "2" (propax) nil nil ))"( " <= 2nil ))nil ))nil ))nil ))th 37nil ))nil ))nil ))"" ( "[T]) nil ))nil ))nil ))nil ))nil ))nil )nil prelude_sets_aux)nil booleans nil )"bool(" skosimpset setsjava.lang.StringIndexOutOfBoundsException: Index 44 out of bounds for length 44"" ( -A2)("" () nil )nil )"" ("s" A!"" "" !") "" ( "" (S"" !") "" (S "!" )" sets_lemmas niljava.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 59 out of bounds for length 65"" "a" NOT const-decl "[bool -> bool]" booleans nil )"" nil "(A!1)" prelude_sets_aux nil "" "setofsets[T]" !") "[T, T -> boolean]" equalities nil )nil prelude_sets_aux )"est(A2" nil 329382339(("1" "" (skosimp*)"" (name " (assert) "1" case "FORALL (A:setofsets[T]((" " "1" " !)java.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 55 nil )" hide2 "2" (induct "n" )"1" (skosimp*)" " =-)"1" (split -2)"(!)) "2" (rewrite "card_is_0" -1)"1" (replace -1 1)"1" ( "[T" "1" "" ( "fullset_is_full?" java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60"1" nil )nil ))nil )"2" (lemma "finite_subset" ("s" "A " Intersection_split" "2" (assert ) nil nil )) nil ))nil ))nil ))nil ))nil )"2" (skosimp*)"2" (expand "<=" -3)"2" (split -3)"1" (inst - "A!2 nil) " A!" "" "!" )"2" expand subset"2" (lemma "nonempty_card" ("S" "(inst "2" (assert )" ( " " (S A2" )"2" (split -1)"1" "" "subset_transitive" "a "rest(A!2)" "b" "A!2" "c" nil java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53"1" "1" "2" propaxnil nil java.lang.StringIndexOutOfBoundsException: Index 70 out of bounds for length 70nil )nil ))"" " "" !") "1" ength 52expand "member" )"choose(A!2)" )" )) "" ( 2)"choose(A!2 (3 lemma " " (s A2 A A1" ))"Intersection(rest(A!2))" )nil "3" ( 2"" ( " (" "" !"" "" !"java.lang.StringIndexOutOfBoundsException: Index 63 out of bounds for length 63 "Intersection_split" nil "java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43 "rational-boolean" nil nil nil ))nil ))expand "choose(A!2)" )"2java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57 expand "member" )"2" nil nil ))nil ))nil sets_lemmasnil java.lang.StringIndexOutOfBoundsException: Index 56 out of bounds for length 56nil )nil )"" "2" (propax) nil nil ))nil ))nil nil ))nil ))nil ))nil java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52expand "nonempty?" )"2" (propax) nil nil ))nil ))nil ))nil ))nil ))nil ))nil )nil ))nil )nil )"3" (hide 2)"3" (skosimp*)t of bounds for length 59"3" (assert )sets_lemmas)nil java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21"booleans ) nil (ubset?const-declboolsetsjava.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40"3" (hide 2)"3" (*)"3" (lemma "finite_subset" ))"3" (assert ) nil " grind ) nil ))nil ))"2" (propax) nil nil ))nil ))nil )nil sets java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 15"{:nat|n S} niljava.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62 " ( union) nil naturalnumbers nil )"bool" reals)nil integers nil )"rational ->boolean" integers)nil rationals nil )"[real -> boolean] (" case-replace(!1x1") nil "[number_field -> ((1 skolem) nil number_fields nil )"number- ] java.lang.StringIndexOutOfBoundsException: Index 69 out of bounds for length 69 nil )nil finite_sets (2 (expand "?" nil set type-eq-decl nil sets nil )nil defined_types nil )nil 2java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37"[, T > boolean" equalitiesnil )nil booleans nil )nil numbers nil )"posint" nil )"(strict_total_order?[real])" real_props nil )nil ))"set" sets nil )nil sets_lemmas nil )"bool" ))nil "setofsets[T]" prelude_sets_aux nil )"(p)" sets nil )"bool" sets nil )"" integersnil )nil sets_lemmas nil )nil finite_setsnil finite_sets nil )nil finite_sets nil )"(strict_total_order?[real])" real_props nil )nil sets_lemmas nil )"set" sets nil )nil sets_lemmas nil )"finite_set" finite_sets nil )nil finite_sets nil )nil naturalnumbers nil )nil defined_types nil )"setofsets[T]" prelude_sets_aux nil )nil sets_lemmas nil )"(surjective?[setofsets[T], set[T]])" sets_lemmas nil )"(partial_order?[set[T]])" nil )"(total_order?[real])" nil )"[bool, bool -> bool]" booleans nil )AND const-decl "[bool, bool -> bool]" booleans nil )"bool" sets nil )"bool" reals nil )"set" sets nil ))nil 3293730382 ("" (grind) nil nil )"set" sets nil )"bool" sets nil ))nil 3293732078"" (skosimp*)"" (apply-extensionality 1 :hide? t)"" (expand "union" )"" (lemma "Union_member" ("x" "x!1" "A" "A!1" ))"" (lemma "Union_member" ("x" "x!1" "A" "rest(A!1)" ))"" (expand "member" )"" (case-replace "Union(A!1)(x!1)" )"1" (simplify -3)"1" (skolem!)"1" (case "choose(A!1) = a!1" )"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" ))"2" (expand "subset?" )"2" expand "member" )"2" "a!1" )"2" assert )"2" (inst + "a!1" ) nil nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )nil prelude_sets_aux nil )nil booleans nil )"set" sets nil ) (choose const-decl "(p)" sets nil )"bool" sets nil )"set" sets nil ) (Union const-decl "set" sets nil )set type-eq-decl nil sets nil )nil sets nil )nil defined_types nil )nil booleans nil )"(surjective?[setofsets[T], set[T]])" sets_lemmas nil )nil prelude_sets_aux nil )"bool" sets nil )NOT const-decl "[bool -> bool]" booleans nil )"bool" sets nil )nil sets_lemmas nil )"[T, T -> boolean]" equalities nil )"set" sets nil )"(A!1)" prelude_sets_aux nil )"setofsets[T]" prelude_sets_aux nil ))nil 3293825830"" (skosimp*)"" (lemma "Intersection_finite" )"" "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" "N!1" "lambda (a:(Complement(A!1))): f!1(complement(a))" )"1" (expand "injective?" )"1" (skosimp*)"1" "x1!1" )"1" "x2!1" )"1" expand "Complement" )"1" "1" replace -1)"1" replace -2)"1" rewrite "complement_complement" )"1" rewrite "complement_complement" )"1" "b!1" )"1" "b!2" )"1" "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" "a!1" )"2" expand "Complement" )"2" "2" "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" "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" "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 )nil prelude_sets_aux nil )nil sets_lemmas nil )"(bijective?[setofsets[T], setofsets[T]])" sets_lemmas nil )"(surjective?[setofsets[T], set[T]])" sets_lemmas nil )nil sets_lemmas nil )"finite_set" finite_sets nil )"bool" finite_sets nil )"setofsets[T]" prelude_sets_aux nil )nil numbers nil )"[number -> boolean]" number_fieldsnil )nil number_fields nil )"[number_field -> boolean]" reals nil )nil reals nil )"[real -> boolean]" rationals nil )nil rationals nil )"[rational -> boolean]" integers nil )nil integers nil )"bool" reals nil )nil naturalnumbers nil )"bool" reals nil )nil nat_types nil )nil sets_lemmas nil )NOT const-decl "[bool -> bool]" booleans nil )"bool" functions nil )nil sets_lemmas nil )nil sets_lemmas nil )"set" sets nil )set type-eq-decl nil sets nil )"setofsets[T]" sets_lemmas nil )nil sets nil )nil defined_types nil )nil booleans nil )nil booleans nil )nil prelude_sets_aux nil ))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" "N!1" "lambda (a:(Complement(F!1))): f!1(complement(a))" )"1" (hide -1 1)"1" (expand "injective?" )"1" (skosimp*)"1" "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 )nil finite_sets nil )"bool" finite_sets nil )set type-eq-decl nil sets nil )nil prelude_sets_aux nil )NOT const-decl "[bool -> bool]" booleans nil )nil booleans nil )nil booleans nil )"(bijective?[setofsets[T], setofsets[T]])" sets_lemmas nil )"finite_set[set[T]]" nil )"finite_set" finite_sets nil )nil finite_sets nil )nil sets_lemmas nil )nil sets_lemmas nil )"bool" functions nil )nil nat_types nil )"bool" reals nil )"set" sets nil )"finite_set[set[T]]" prelude_sets_aux nil )"setofsets[T]" sets_lemmas nil )nil sets nil )nil defined_types nil )nil numbers nil )"[T, T -> boolean]" equalities nil )"[number -> boolean]" number_fieldsnil )nil number_fields nil )"[number_field -> boolean]" reals nil )nil reals nil )"[real -> boolean]" rationals nil )nil rationals nil )"[rational -> boolean]" integers nil )nil integers nil )"bool" reals nil )nil naturalnumbers nil )"nat" finite_sets nil )"{n: nat | n = Card(S)}" finite_sets nil ))
Messung V0.5 C=100 H=100 G=100
¤ Dauer der Verarbeitung: 0.16Angebot
¤ *Eine klare Vorstellung vom Zielzustand
