| Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/PVS/structures/ (Beweissystem der NASA Version 6.0.9©) Datei vom 28.9.2014 mit Größe 83 kB |
|
Quelle save.prf Sprache: Lisp |
|||||||||
|
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
nil (bij_TCC1-1 nil 3 is_finite ""finite_sets ( ( "bij_exists" (("" (inst + "(LAMBDA (S: finite_set[T]): choose({f: [(S) -> below nonempty-type-declnumbers number_field_pred"number- ]"njava.lang.StringIndexOutOfBoundsException: Index 69 ("() (("" (inst?) ("(*) (("" ( ( rationalsniljava.lang.StringIndexOutOfBoundsException: Index 56 out of bou (("" (expand "empty?") (("" (expand( nonempty-type-eq-decl nil nil)( "T - ]"equalities) nil)) nil)) nil)) nil)) nil)) nil) unchecked ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (set type-eq-decl nil sets nil) (is_finite const-decl "bool" finite_sets nil) (finite_set type-eq-decl nil finite_sets nil) (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (card const-decl"{: | n=CardS)}"finite_sets niljava.lang.StringIndexOutOfBoundsEx ( [ >] nil (real nonempty-type-from-decl nil reals nil) (rational_pred "" ) ( nil ) (integer_pred const-decl "[rational -> boolean(? const-decl bool nil (int nonempty-type-eq-decl nil integers nil( ormal-type-decl nil) (= const-decl boolrealsnil (nat nonempty-type-eq-decl nil naturalnumbers nil) " inst ( S T) (())) (Card const-decl " (("(* ( const-decl{:nat = ()"finite_setsniljava.lang.StringIndexOutOfBoundsException: Ind (below("( member) (bijective? const-decl "bool" functions " hide-)(" skosimp)(" ? ) nil) nonempty const-decl"ool nil) (choose const-decl "(p)" sets nil) (member const-decl "bool" sets nil) (empty? const-decl "bool" sets nil)java.lang.StringIndexOutOfBoundsException: Index (T formal-type-decl (non_empty_finite_set nil nil ( (finite type-eq-declnil nil) (ibij_TCC1-1nil 340770523407257 ("" (inst + "(LAMBDA (S: non_empty_finite_set[T] (set type-eq-declnil sets nil) (("" (skosimp) (("" (typepred "S!1") (("" (expand "empty?") (" ( "member) (("" (hide -1) (("" (skosimp*) (("" (inst?) nil nil)) nil)) nilbooleannonempty-type-decl niljava.lang.StringIndexOutOfBoundsException: Index nil bij_ibij nil) nil "" (*) nil)) nil) unchecked ((non_empty_finite_set type-eq-decl nil finite_sets ("( "omp_inverse_right(1,(card1) (? "" setsnil (finite_set type-eq-decl nil finite_sets nil) (is_finite const-decl "bool" finite_sets nil) set niljava.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for leng Tformal-type-declfseq2set (NOT const-decl "[bool -> fseq2set niljava.lang.StringIndexOutOfBoundsExceptio ( ) (boolean nonempty-type-decl nil booleans nil) (member const-decl "bool" sets nil)) 132 110 set java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for l ( [- "booleans) (bij_ibij-1 nil 3440771597 3440772897 ("" (skosimp*) (("" (expand "ibij") (("" (lemma "comp_inverse_right[(S!1),below(card(S!1))]") (("" (inst?) nil nil" sets nil) nil)) nil) unchecked (( (number nonempty-type-decl nil numbers nil) fseq2set nil) (bij const-decl "{f: [(S) -> below(card(S))] | bijective?(f)}" nil bijective ""functions nil) ( formula-decl ) (T formal-type-decl nil fseq2set number_fieldnonempty-type-from-declnil number_fields (boolean nonempty-type-declrational nil ) (bool( const-decl[ >"integers) (set type-eq-decl nil sets nil) (is_finite const-decl "bool" finite_sets nil) (finite_set type-eq-decl nil finite_sets nil) (NOT const-decl "[bool (natnonempty-type-eq-decl niln nil) (empty? const-decl "bool" sets = const-decl [,T -"equalities ) (non_empty_finite_set type-eq-decl nil finite_sets nil) ( nonempty-type-decl 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]" nil) (real nonempty-type-from-decl nil reals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (rational nonempty-type-from-decl 0 const-decl [rational>boolean"integersnil (int nonempty-type-eq-declnil ) "( nat nil ) (< const-decl "bool" reals nil) =const-decl"T T- boolean] equalities nil) (Card const-decl "nat" finite_sets nil) (card const-decl "{n: nat | n = Card( ("( bijective_inverseS1,(cardS!1)]"j (below type-eq-decl nil naturalnumbers nil)) 2 0tshostak) (ibij_bij 0 (java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 11 ("(*) (("" (assert) (("" (expand "ibij") (" assertjava.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for l (" ( "bijective_inverse[(S!1,(card(S!))]" (("" (inst?) (("" function_inversenil) )java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15 nil)) nil)java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length nil) unchecked ((bijective_inverse_is_bijective application-judgement( formal-type-decl nilfseq2se "[,D) function_inverse ) (unique_bijective_inverse application-judgementbool nil ) function_inverse (bij const-decl "{( const-decl bool nil fseq2set nil) (bijective? const-decl "bool" functions nil) bijective_inverse java.lang.StringIndexOutOfBoundsException: Index 61 out of boun (T ( finite_sets) (boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) ( type-eq-decl sets ) (is_finite const-decl "bool" finite_sets nil) (finite_set type-eq-decl nil finite_sets nil) (NOT java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length (empty? const-decl "bool" sets nil) (non_empty_finite_set type-eq-decl nil nil) (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) ( nonempty-type-from-decl niljava.lang.StringIndexOutOfBoundsException: Index 64 o ( const-decl[ >boolean" nil) (real nonempty-type-from-decl nil reals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (rationalnonempty-type-from-declnil rationals nil) (integer_pred "[rational > boolean" integers nil (nt nonempty-type-eq-decl nil integers nil) (>= const-decl "bool" reals nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) <const-declboolreals) (= const-decl "[T, T -> boolean]" equalities nil) (Card const-decl "nat" finite_sets nil) cardconst-decl"n:nat|n=CardS} finite_sets niljava.lang.StringIndexOutOfBoundsExc (below type-eq-decl nil naturalnumbers nil) (ibij const-decl "{f: [below(card(S)) -> (S)] | bijective?(f)}" fseq2set nil)) 33 t )) (seq2set_TCC1( const-decl"n:nat|n =Card(S}"finite_sets) (below nil naturalnumbers ) ("" (kosimp) (("" (assert) (("" (lemma "is_finite_surj") (""(inst (("" (assert) (("" java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 18 (" assert) "(LAMBDA (ii: below(length(fs!1))): seq(!1())) (("1" (expand "surjective?") "assert (("1" ( (("" ( "LAMBDAii (length(fs!))) (("1" (assert) (("1" (inst?) (""() (("1" (expand "typepredy1) (("1" (propax) nil nil)) nil)java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (skosimp*) (("2 () (("2" (expand "finseq_appl") " propax nil )) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil))("2 skosimp) nil unchecked (( " expand finseq_appl) (bool nonempty-type-eq-decl nil booleans nil) ( type-eq-decl nil (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl "[number -) 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]" rationalsnil)) (rational nonempty-type-from-decl nil rationals nil) (integer_pred const-decl nil) (intnonempty-type-eq-decl integers nil) (>= const-decl "bool" reals nil) (nat nonempty-type-eq-declunchecked (< const-decl ( nonempty-type-declnilbooleans) type-eq-declnilfseqs"/") set nilsetsjava.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for ( nilnaturalnumbers nil ( [, >boolean niljava.lang.StringIndexOutOfBoundsException: Index 53 out of bounds f (surjective? const-decl "bool" functionsrational_pred [ >"rationals (NOT const-decl const-decl [ - ] nil (below type-eq-decl nil nat_types nil) (is_finite_surj formula-decl nil finite_setsnil) (T formal-type-declnilfseq2setnil)) 59 40 t shostak)) (seq2set_lem 0 ( nonempty-type-eq-declnil naturalnumbers ) ("" (skosimp*) ((""(expand"finseq_appl" (("" (assert) (("" (expand "seq2set") (("" (( nil nil)) nil)) nil)) nil) unchecked (? const-decl "" functionsnil) ((belowtype-eq-declnilnaturalnumbersnil) ype-eq-declnilfseqs"tructures") (barray type-eq-decl nil fseqs "structures/") (T formal-type-decl ( formula-decl nilfinite_sets) (< const-decl "bool" reals nil) ( nonempty-type-eq-decl naturalnumbersnil) (>= const-decl "bool" reals nil) (bool nonempty-type-eq-decl nil booleans nil) int nil integers nil) ( const-decl "rational > boolean]" integers nil) ( ("" (skosimp*) (rational_pred const-decl "[real -> boolean]" rationals nil) (real nonempty-type-from-decl nil reals nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (number_field nonempty-type-from-decl nil number_fields (" expand"" ("inst) ) ) (number_field_pred const-decl "[number -> boolean]"nil) nil ) (boolean ( type-eq-decl java.lang.StringIndexOutOfBoundsException: Index 47 out of ) (seq2set const-decl "finite_set[T]" fseq2set< bool nil 35 20 t shostak)) ( 0 (card_seq2set-2 "" 32830865 bool nil ) ("" (skosimp* " > boolean]"nil (("" const-decl " java.lang.StringIndexOutOfBoundsException: Index 64 out of bound ( typepred(1" (( [->number_fields "expand") (("" (lemma ( nonempty-type-declnil ) ( ) (("" (assert) ((" expand seq2set" (("" (expand "finseq_appl") (("" (lemma "Card_injection") (("" (expand "injective?") ((" (inst -1 "{s: T | EXISTS (kk: below(length(fs!1))): (""(inst?) (" (expand "seq2set) (("" (assert) (("" (inst (("" (lemma "") (("1" (skosimp*) "{s: (kk: below((!)) !`(kk=} ("2" (skosimp*) (("2" "nonempty?") (inst (typepred "f!1") (("2" (expand "empty?") ("" (expand "member") (("2" (inst -2 "kk!1") nil nil)) nil "!" nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) nil)) nil)) nil)) nil)) nil) unchecked ( finite_set nil (finite_set type-eq-decl nil finite_sets nil) (fseq type-eq-decl nil fseqs "structures/") (barraytype-eq-decl nil fseqs"tructures"java.lang.StringIndexOutOfBoundsException: (nat nonempty-type-eq-decl nil naturalnumbers nil) (s_finiteconst-decl bool" nil) (set type-eq-decl nil sets nil) (T formal-type-decl nil fseq2set nil) (NOT const-decl java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds (bool nil ) (injective ) (empty? const-decl "bool" sets nil) (member const-decl "bool" sets nil) nil nat_typesnil) (AND(finite_set type-eq-decl finite_sets) (IMPLIES const-decl "[bool, bool -> (fseq nil fseqs "/) < ""reals) (min const-decl "{a | S(a) AND (FORALL x: S(x) IMPLIES a <= x)}" min_nat nil) (nonempty? const-decl "bool" sets nil) (= const-decl "[T, T( type-eq-declnil sets nil) below nil nil) (< const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (rational nonempty-type-from-decl nil rationals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (Card_injection formula-decl nil finite_sets nil) (real_ge_is_total_order name-judgement "(total_order?real])" real_propsnil) (real_le_is_total_order ""sets) real_props nil) (seq2set_lem formula-decl nil fseq2set nil) (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl"[number - boolean]"number_fields nil) (IMPLIESconst-decl"[bool bool ->bool] booleans nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (real (< const-decl bool reals nil) (>= const-decl "bool" reals nil)) 231 190 (minconst-decl"a|Sa AND FORALLx (x a < x)" (card_seq2set-1 nil 3282918983 3283085680 ("" (skosimp*) (("" (expand "seq2set") (("" (expand "finseq_appl" (? boolsets) "(" (("" (inst?) (("" (assert) (("" (expand "seq2set") (("" (expand int nilintegersjava.lang.StringIndexOutOfBoundsException: Index 48 out rational_pred [ - ] rationals ) "( injective" java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26 ( -java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 3 " ( formula-decl nilfseq2setnil) "length(fs!1)") (("1" (assert) (("1" (hide 2) (("1" > const-decl"bool"reals ) (" expand"" (("1" (skosimp*) (("1" (inst-cp("(java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for "( Card_injection" "min({kk: below(length(fs!1 ((java.lang.StringIndexOutOfBou (("1" (inst -2 :(1 1`) !}) (("1" (skosimp*) (("1" (assert) nil nil)) ("2" "1" (("2" (assert) nil nil)) nil)) nil) ("2" (assert) nil nil)) nil)) nil) ("2" * (("2" (reduce) 2 (grind) (("2" (postpone) nil nil)) nil)) nil)) nil)) nil)) nil)) ) ("2" (postpone) nil nil)) nil)) nil)) )) nil)) nil)) nil)) nil)) nil)) nil)) nil) unfinished nil 5068986 8940 t shostak ) (minmax_seq2set_TCC1 0 (minmax_seq2set_TCC1-1 3821778407507 ("" (skosimp*) (("" (expand "empty?") (("" (expand"member"java.lang.StringIndexOutOfBoundsException: Index 28 out of bo (""" (("" (inst - "ne_fs!1`seq(0)") (("" (inst + "0") (("" (assert) (("" (expand "finseq_appl") (("" (propax) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) nil) nil) unchecked ((empty? const-decl "bool" sets nil) )) (seq2set const-decl "finite_set[T]" fseq2set nil) ( name-judgement "(strict_total_order?[real])" real_props nil) ( "[real -> boolean]" rationals ) (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) (< const-decl "bool" reals nil) (below type-eq-decl nil (("(""java.lang.StringIndexOutOfBoundsException: Index 28 o ne_fseqtype-eq-decl fseqs"structures/) (> const-decl "bool" reals nil) (bool nonempty-type-eq-decl nil booleans nil) e-from-decl nilrealsnil) (real_pred const-decl "[number_field -> boolean]" reals nil) (number_field nonempty-type-from-decl nil number_fields nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (boolean nonempty-type-decl nil booleans nil) (number nonempty-type-decl nil numbers nil) (fseqtype-eq-decl fseqs "structures/") (barray type-eq-decl nil fseqs "structures/") (nat nonempty-type-eq-decl nil naturalnumbers nil) ( nil) (member const-decl "bool" sets nil)) 19 20 t shostak)) ) (minmax_seq2set 0 (minmax_seq2set-2 "" 3283271310 3440772898 ("" (skosimp*) (("" (typepred "seq2set(ne_fs unchecked (" typepred "ne_fs!1") (("" (split) (("1" (typepred "min(ne_fs!1)") (1"(""java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for leng (("1" (assert) (("1" (skosimp*) (("1" (expand "finseq_appl") (("1" (inst?) (("1" (lemma "seq2set_lem") (1 (?) (("1" (expand ne_fseq "/" (("1" (expand "finseq_appl bool nilbooleansniljava.lang.StringIndexOutOfBounds (("1" (inst?) (("1" (lemma "min_seq_lem") number nil niljava.lang.StringIndexOutOfBoundsException: Index 47 out of bounds fo (name min,]sT kk!)ne_fs1=)) (("1" (replace -1) (("1" (typepred "mm") (( 90 )) (minmax_seq2set 0 (("1" (case "mm <= ("(* (("1" (assert) (("1" (case "min(ne_fs!1 <=mm") (("1" (assert) (("1" (typepred "<=") (("1" (expand "total_order?") (("1" (flatten) 1 "dichotomous?") (("1" (expand "partial_order?") (("1" (expand "antisymmetric?") (("1" (flatten) (inst -2 (("1" "min(ne_fs!1)") (("1" (assert) nil)) (flatten) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (assert) (("2" (typepred "<=") (("2" (expand "total_order?") (("2" (expand "dichotomous?") (("2" (expand "partial_order?") (("2" ) (("2" (expand "antisymmetric?") (("2" (inst nil) (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (inst? -2) (" (assert) nil nil)) nil)) nil)) )java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47 nil)) ("2" ) (("2" (("2" (expand "empty?") (("2" ( (("2" (inst?) (("2" (inst?) nil nil)) nil)) nil)) )) nil)) nil)) nil) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (typepred "max(ne_fs!1)") (("2" (expand "seq2set") (("2" (assert) (("2" (skosimp) (("2" (expand "finseq_appl") (("2" (inst?) (("2" (lemma "seq2set_lem") "2 (("2" (expand "seq2set") (("2" (expand "finseq_appl") (("2" (inst?) (("2" (lemma "max_seq_lem") (("2" (name mm " max[T, <=] ({s: T | EXISTS (kk: below(length(ne_fs!1))): ne_fs!1`seq(kk) = s})") (("1" (replace -1) (("1" (typepred "mm") (("1" (skosimp*) (("1" (case"m<= max(ne_fs!1)") (("1" (assert) (("1" (case "max(ne_fs!1) <= nil)) (("1" (assert) (("1" (typepred "<=") ( ) (expand "total_order?") (("1" (flatten) (("1" (expand dichotomous (("1" (expand "partial_order?") (("1" inst "antisymmetric?") (("1" (flatten) (("1" (inst -2 "max(ne_fs!1)") (("1" (assert) nil skosimp nil)) nil)) (assertjava.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for len nil)) nil)) nil)) nil)) nil)) nil) ("2" (assert) (("2" (("1" ( (expand "total_order?") (("2" (expand "dichotomous?") (("2" "partial_order?") (("2" (flatten) (("2" (expand "antisymmetric?") (("2" (expand "preorder?") (("2" (expand "reflexive?") (("2" (expand "transitive?") (("2" (flatten) (("2" (lemma "max_lem") (("2" (inst? -1) (("1" (replace -9) (("1" (assert) (("1" () (("1" (skosimp*) (inst?) nil (expand nil)) nil)) nil)) nil) ("2" (expand "empty?") (("2" ?) (("2" (expand "member") (("2" (assert) nil nil)) ("" nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) nil) ("2" (inst?) (("2" (inst -4 "ne_fs!1" "kk!1") (("2" (assert) nil)) nil)) nil)) nil)) ) nil) ("2" "empty?") (("2" (assert) (("2" (expand "empty?") (("2" (inst?) (2" (expand "member") (("2" (inst 1 "jj!1") (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) unchecked ((ne_fseq type-eq-decl nil fseqs "structures/") (> const-decl "bool" reals nil) (real nonempty-type-from-decl nil reals nil (real_pred const-decl "[number_field -> boolean]" reals nil) (number_field nonempty-type-from-decl nil number_fields nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (number nonempty-type-decl nil numbers nil) (seq2set const-decl "finite_set[T]" fseq2set nil) (finite_set type-eq-decl nil finite_sets nil) fseqtype-eq-decl fseqs "structures/java.lang.StringIndexOutOfBoundsException: Rang (barray type-eq-decl nil fseqs "structures/") (nat nonempty-type-eq-decl nil naturalnumbers nil) (is_finite const-decl"bool"finite_setsnil) (set type-eq-decl nil sets nil) (T formal-type-decl nil fseq2set nil) (NOT const-decl "[bool -> bool]" booleans nil) (bool nonempty-type-eq-decl nil booleans nil) booleannonempty-type-decl nil nil) (seq2set_lem formula-decl nil fseq2set nil) (empty nil)) (non_empty_finite_set type-eq-decl nil finite_sets nil) (IMPLIES const-decl "[bool, bool -> bool]" booleans nil) (min const-decl "{a: T | SS( ("2" "finite_sets/) (partial_order? const-decl "bool" orders nil ("" ( (assert (? "bool" orders nil (member const-decl "bool" sets nil) (min_seq_lem formula-decl nil min_fseq "structures/") (below type-eq-decl nil naturalnumbers nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (rational_pred const-decl"[real ->boolean]"rationalsniljava.lang.StringIndexOutOf (rational nonempty-type-from-declnilrationalsnil) (integer_pred const-decl "[rational -> boolean]" integers nil) (int nonempty-type-eq-decl nil integers nil) (>= const-decl "bool" reals nil) (< const-decl "bool" reals nil) (pred type-eq-decl nil defined_types nil) (total_order? const-decl "bool" orders nil) (<= formal-const-decl "(total_order?[T])" fseq2set nil) domtype-eq-declnilmin_fseq "/"java.lang.StringIndexOutOfBoundsException: Index 49 ( const-decl"[ool, bool - bool]" booleansnil) (= const-decl "[T, T -> boolean]" equalities nil) (min const-decl "{t: T | (FORALL (ii: dom(s)): t <= seq(s)(ii)) AND java.lang.StringIndexOutOfBoundsException: In (EXISTS (jj: dom(s)): seq(s)(jj) = t)}" min_fseq "structures/") (max const-decl "{a: T | SS(a) AND (FORALL (x: T): SS(x) IMPLIES x <= a)}" finite_sets_minmax "finite_sets/") (preorder? const-decl "bool" orders ) (transitive? const-decl "bool" relations nil) (max_lem formula-decl nil finite_sets_minmax "finite_sets/") ( java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27 (max_seq_lem formula-decl nil max_fseq "structures/") (dom type-eq-decl nil max_fseq "structures/") (max const-decl "{t: T | (FORALL (ii: dom(s)): seq(s)(ii) <= t) AND (EXISTS (jj: dom(s)): seq(s)(jj) = t)}" max_fseq "structures/")) 861 760 t shostak) (minmax_seq2set-1 nil 3283098598 3283255060 (" (skosimp*) (" typepredseq2setne_fs1" (" typepred"ne_fs) (("" (split) (("1" (typepred "min(ne_fs!1)") (("1" (expand "seq2set") 1() (("1" (skosimp*) (("1" (expand "finseq_appl") (("1" (inst?) (("1" (lemma "seq2set_lem") (("1" (inst?) (("1" (expand "seq2set") (1 expand) (("1" ?) (("1" (lemma "min_seq_lem") (("1" (skosimp*) (("1" (name mm "min[T, min (("1" (replace -1) (("1" ?"" nil (("1" (skosimp*) (("1" (case "mm <= min(ne_fs!1)") (("1" (assertint nilintegers nil) (("1" (case "min (? bool ) (("1" (assert) (("1" (typepred "<=") ( const-decl{: | (expand "total_order?") (("1" (flatten) (("1" (expand "dichotomous?") ( (expand "partial_order?") (("1" (expand "antisymmetric?") (("1" (flatten) typepred"(!)) (inst -2 * "min(ne_fs!1)") (("1" (assert((1 expand"") nil nil)) nil)) nil)) nil)) "min[T <=](s: T| (kk: below(length(ne_fs1)) ne_fs!1seq(k)=s})") nil)) nil) ("2" (inst? -5) (("2" (inst?) (("2" (postpone) nil nil)) nil)) (case nil)) nil) ("2" (postpone) nil nil)) nil)) nil)) nil)) nil) ("2" (postpone) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) nil)) nil)) nil) "partial_order?" nil)) (expand nil)) nil) ("2" (postpone) nil nil)) nil)) nil)) nil)) nil) unfinished nil (("" (seq2set_TCC2 0 ( ("" (skosimp*) (("" (expand "nonempty?") (("" (lemma "minmax_seq2set_TCC1") (("" (inst?) (("" (assert nil)) nil)) nil)) nil) unchecked ((nonempty? const-decl "bool" sets nil) (ne_fseq (> const-decl "bool" reals nil) (bool nonempty-type-eq-decl nil booleans nil) (real nonempty-type-from-decl nil reals nil) (real_pred const-declnil)) (number_field nonempty-type-from-decl nil number_fields nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) ( nonempty-type-declnil nil (number nonempty-type-decl nil numbers nil) (fseq type-eq-decl nil fseqs "structures/") (T formal-type-decl nil fseq2set nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (minmax_seq2set_TCC1 subtype-tcc nil fseq2set nil)) 30 10 t shostak)) (set2seq_TCC1 0 (set2seq_TCC1-2 nil 3 (ostpone ("" (inst + "(LAMBDA (S: finite_set[T]): choose({fs: fseq[T] | length(fs) = card[T](S) AND (FORALL (ii: below(length(fs))): S(fs`seq(ii))) AND (FORALL (x: T): S(x) IMPLIES (EXISTS (ii: below(length(fs))): fs`seq(java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for len AND (FORALL (ii, jj: below(length(fs))): ii /= jj IMPLIES fs`seq(ii) /= fs`seq(jj))}))") (" skosimp) (java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19 (("1" (typepred "ibij(S!1)") (("1" (replace -2 * lr) (("1" (hide -2) (("1" (expand "nonempty?") (("1" (expand "empty?") (("1" (expand "member") ("" (inst -2 "(# length := card(S!1), seq := (LAMBDA (i: nat): IF i < card(S!1) THEN F(i) ELSE default ENDIF) #)") (("1" (prop) (("1" (ground) nil nil) ("2" (skosimp*) (("2" (inst + "bij(S!1)(x!1)") (("2" (java.lang.StringIndexOutOfBoundsException: Range [46, 42) out of bounds fo (("2" (ground) ((2" (expand "F") (("2" (rewrite "ibij_bij") nil nil)) nil)) nil) nil)) nil)) nil) ("3" (skosimp*) (("3" (lift-if) (("3" (ground) (("3" (expand "bijective?") (("3" (flatten) (("3" (expand "injective?") (("3" (inst?) (("3" (assert) nil nil)) nil)) nil)) nil)) nil)) nilnil) nil)) nil)) nil) ("2" (skosimp*) (("2" (lift-if) (("" ) nil) ("" replace ) nil)) nil ( "empty" nil nil)) nil)) nil)"( length = 0 seq : LAMBDAi) " nil) ("2" (expand "nonempty?") (("2" (lemma "empty_card") (("2" (inst?) (("2" (assert) (("2" (replace "java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds (("2" (hide -1) (("2" (hide -1) (("2" (expand "empty?") (("2" (expand "member") (("2" (inst - "(# length := 0, seq := (LAMBDA (i: nat): default) #)") (("2" (prop) (("1" (skosimp*) java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds ("2" (skosimp*) (("2" (assert) (("2" (reveal -2) (("2" (expand "empty?") (("2" (expand "member") real_lt_is_strict_total_order ) nil)) nil)) nil) ("3" (skosimp*) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ( const-decl[bool - ] booleans) below nil nil) nil)) nil)) nil) unchecked ((empty_card formula-decl nil finite_sets nil) (IF const-declint nilintegersjava.lang.StringIndexOutOfBoundsException: Index 48 o """ (injective? const-decl "bool" functions nil) (ibij_bij formula-decl nil fseq2set nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) bij":[) >belowcard())] |bijective?f} fseq2set nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (member const-decl "bool" sets nil) (ibij const-decl "{f: [below(card(S)) -> java.lang.StringIndexOutOfBoundsException fseq2set nil) bijective const-decl "bool functions nil) (non_empty_finite_set type-eq-decl nil finite_sets nil) (? const-declbool sets nil) (NOT const-decl "[bool -> bool]" booleans nil) (choose const-decl "(p)" sets nil) (nonempty? const-decl "bool" sets nil) (/= const-decl "boolean" notequal nil) (IMPLIES const-decl "[bool, bool -> bool]" booleans nil) ( type-eq-decl naturalnumbersnil (< const-decl "bool" reals nil) (card const-decl "{n: nat | n = Card(S)}" finite_sets nil) (Card const-decl "nat" finite_sets nil) (= const-declboolrealsnil (int nonempty-type-eq-decl nil integers nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (rational nonempty-type-from-decl nil rationals nil) (rational_pred const-decl "real- boolean"rationals) (real nonempty-type-from-decl nil reals nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (number_field nonempty-type-from-decl nil number_fields nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (= const-decl "[T, T -> boolean]" equalities nil) (number nonempty-type-decl nil numbers nil) (AND const-decl "[bool, bool -> bool]" booleans nil) (fseq type-eq-decl nil fseqs "structures/") (barray type-eq-decl nil fseqs "structures/") (nat nonempty-type-eq-decl nil naturalnumbers 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) (("( 2java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for leng (boolean nonempty-type-decl nil booleans nil) (T formal-type-decl nil fseq2set nil)) 365426 390 t nil) (set2seq_TCC1-1 nil 3280842302 3440770670 ("" (inst + "(LAMBDA (S: finite_set[T]): choose({fs: fseq[T] | length(fs) = card[T](S) AND (FORALL (ii: below(length(fs))): S(fs`seq(ii)) AND (FORALL (x: T): S() IMPLIES (ii: below(length(fs))): (1 expand) AND (FORALL (ii, jj: below(length(fs))): ii /= jj IMPLIES fs`seq(ii) /= fs`seq(jj)))}))") (" () (("" (name "F" "bij(S!1)") (("" (typepred "bij(S!1)") (("" (replace -2 * lr) (("" (hide -2) (("" (expand "nonempty?") (("" (expand "empty?") ()java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 1 nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil unfinished ((nonempty( const-decl"" reals ) shostak)) (set2seq_length 0 (set2seq_length-1 nil 3281098906 3440772898 ("" (induct "S" 1 "finite_set_induction_rest[T]") (("1" (expand "set2seq") (("1" (expand "fseq1") (( rational rationals nil) (("1" (ground) (("1" (case "empty?[T](emptyset[T])") (("1" (assert) (("1" (rewrite "card_emptyset[T]") (("1" (assert) (("1" (expand "empty_seq") (("1" (propax) nil nil)) nil)) niljava.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length nil)) nil) ("2" (hide 2) (("2" (grind) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (skosimp*) (("2" (expand "set2seq" 1) (("2" (expand "o ") (("2" (expand "fseq1") (("2" (assert) (("2" (rewrite "card_rest") (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil) nil)) nil) unchecked) ((finite_rest application-judgement "finite_set[T]" fseq2set nil) finite_emptyset "" finite_sets nil) (finite_emptyset name-judgement "finite_set[T]" fseq2set nil) (finite_set_induction_rest formula-decl nil finite_sets_inductions finite_sets) (T formal-type-decl nil fseq2set nil) (set2seq const-decl "{fs: fseq[T] | length(fs) = card(S) AND (FORALL (ii: below"typepredset2seq()) ( x )java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length S(x) IMPLIES (EXISTS (ii: below(length(fs))): fs`seq(ii) = x)) AND (FORALL (ii, jj: below(length(fs))): ii /= jj IMPLIES fs`seq(ii) /= fs`seq(jj))}" fseq2set nil) (/= const-decl "boolean" notequal nil) (IMPLIES const-decl "[bool, bool -> bool]" booleans nil) (below type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (card const-decl "{n: nat | n = Card(S)}" finite_sets nil) (Card const-decl "nat" finite_sets nil) (>= const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (integer_pred const-decl "[rational -> boolean]" integers nil) ( ", - bool] ) (rational_pred const-decl "[real -> boolean]" rationals nil) (real nonempty-type-from-decl nil reals nil) real_pred [- ] nil) (number_field nonempty-type-from-decl nil number_fields nil) ( const-decl"number>boolean"number_fields nil) (AND const-decl "[bool, bool -> bool]" booleans nil) (fseq type-eq-decl nil fseqs "structures/") (barray type-eq-decl nil fseqs "structures/") (nat nonempty-type-eq-decl nil naturalnumbers nil) (= const-decl "[T, T -> boolean]" equalities nil) (number nonempty-type-decl nil numbers nil) (pred type-eq-decl nil defined_types nil) (inite_set nil finite_sets) (is_finite const-decl "bool" finite_sets nil) (set type-eq-decl nil sets nil) (bool nonempty-type-eq-decl nil booleans nil) (boolean nonempty-type-decl nil booleans nil)) 84 70 t shostak)) (set2seq_lem 0 (set2seq_lem-1 nil 3280846807 3440772898 ("" (skosimp*) (("" (assert) (("" (skosimp*) (("" (typepred "set2seq(S!1)") (("" (inst?) (("" (flatten) nil nil)) nil)) nil)) nil)) nil)) nil) unchecked nil 28 20 t shostak)) (set2seq_exists 0 (set2seq_exists-2 nil 3410632995 3440772939 ("" (skosimp*) (("" (assert) (("" (flatten) (("" (typepred "set2seq(S!1)") (("" (inst -3 "x!1") (("" (assert) nil nil)) nil)) nil)) nil)) nil)) nil) unchecked ((set2seq const-decl "{fs: fseq[T] | length(fs) = card(S) AND (FORALL (ii: below(length(fs))): S(fs`seq(ii))) AND (FORALL (x: T): S(x) IMPLIES (EXISTS (ii: below(length(fs))): fs`seq(ii) = x)) AND (FORALL (ii, jj: below(length(fs))): ii /= jj IMPLIES fs`seq(ii) /= fs`seq(jj))}" fseq2set nil) (/= const-decl "boolean" notequal nil) (IMPLIES const-decl "[bool, bool -> bool]" booleans nil) (below type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (card const-decl "{n: nat | n = Card(S)}" finite_sets nil) (Card const-decl "nat" finite_sets nil) (>= const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (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]" reals nil) (number_field nonempty-type-from-decl nil number_fields nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) --> -------------------- --> maximum size reached --> -------------------- ¤ 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.47Bemerkung: ¤*Bot Zugriff |
|
2026-03-28