| products/sources/formale Sprachen/PVS/matrices/ |
|
Quellcode-Bibliothek© Kompilation durch diese Firma[Weder Korrektheit noch Funktionsfähigkeit der Software werden zugesichert.]Datei: profiling.txt Sprache: TextOriginal von: PVS© |
|
||||||
|
(query_coeff
(bump_one_ind_TCC1 0 (bump_one_ind_TCC1-1 nil 3621165054 ("" (subtype-tcc) nil nil) ((posint_plus_nnint_is_posint application-judgement "posint" integers nil)) nil)) (bump_one_ind_TCC2 0 (bump_one_ind_TCC2-1 nil 3621165054 ("" (subtype-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans 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) (> 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) (nonneg_int nonempty-type-eq-decl nil integers nil) (posnat nonempty-type-eq-decl nil integers nil) (above nonempty-type-eq-decl nil integers nil) (= const-decl "[T, T -> boolean]" equalities nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (below type-eq-decl nil naturalnumbers nil) (<= const-decl "bool" reals nil) (numfield nonempty-type-eq-decl nil number_fields nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (upto nonempty-type-eq-decl nil naturalnumbers nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil) (real_le_is_total_order name-judgement "(total_order?[real])" real_props nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil)) nil)) (bump_one_ind_TCC3 0 (bump_one_ind_TCC3-1 nil 3621165054 ("" (skeep) (("" (typepred (f)) (("" (typepred (i)) (("" (skeep) (("" (inst -2 "k") (("" (typepred (k)) (("" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) ((below type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (= const-decl "[T, T -> boolean]" equalities nil) (above nonempty-type-eq-decl nil integers nil) (posnat nonempty-type-eq-decl nil integers nil) (nonneg_int nonempty-type-eq-decl nil integers nil) (>= const-decl "bool" reals 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) (number nonempty-type-decl nil numbers nil) (NOT const-decl "[bool -> bool]" booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (boolean nonempty-type-decl nil booleans nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (real_le_is_total_order name-judgement "(total_order?[real])" real_props nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (<= const-decl "bool" reals nil) (numfield nonempty-type-eq-decl nil number_fields nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (upto nonempty-type-eq-decl nil naturalnumbers nil)) nil)) (bump_one_ind_TCC4 0 (bump_one_ind_TCC4-1 nil 3621165054 ("" (subtype-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans 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) (> 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) (nonneg_int nonempty-type-eq-decl nil integers nil) (posnat nonempty-type-eq-decl nil integers nil) (above nonempty-type-eq-decl nil integers nil) (= const-decl "[T, T -> boolean]" equalities nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (below type-eq-decl nil naturalnumbers nil) (<= const-decl "bool" reals nil) (numfield nonempty-type-eq-decl nil number_fields nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (upto nonempty-type-eq-decl nil naturalnumbers nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil) (real_le_is_total_order name-judgement "(total_order?[real])" real_props nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (int_minus_int_is_int application-judgement "int" integers nil)) nil)) (bump_one_ind_TCC5 0 (bump_one_ind_TCC5-1 nil 3621165054 ("" (skeep) (("" (typepred (i)) (("" (split-ineq -1) (("" (typepred (f)) (("" (inst -1 "i") (("" (ground) nil nil)) nil)) nil)) nil)) nil)) nil) ((upto nonempty-type-eq-decl nil naturalnumbers nil) (posnat nonempty-type-eq-decl nil integers nil) (> const-decl "bool" reals nil) (nonneg_int nonempty-type-eq-decl nil integers nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (numfield nonempty-type-eq-decl nil number_fields nil) (nat nonempty-type-eq-decl nil naturalnumbers 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) (<= 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) (NOT const-decl "[bool -> bool]" booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (boolean nonempty-type-decl nil booleans nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil) (= const-decl "[T, T -> boolean]" equalities nil) (real_le_is_total_order name-judgement "(total_order?[real])" real_props nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (int_minus_int_is_int application-judgement "int" integers nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil)) nil)) (bump_one_ind_TCC6 0 (bump_one_ind_TCC6-1 nil 3621165054 ("" (skeep) (("" (skeep) (("" (typepred " v(j, f, i + 1)") (("1" (typepred (k)) (("1" (inst -2 "k") (("1" (ground) nil nil)) nil)) nil) ("2" (typepred (i)) (("2" (case "i<1+j") (("1" (ground) nil nil) ("2" (case "i=1+j") (("1" (ground) (("1" (typepred (f)) (("1" (inst -1 "i") (("1" (ground) nil nil)) nil)) nil)) nil) ("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) ((real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil) (real_le_is_total_order name-judgement "(total_order?[real])" real_props nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil) (boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans 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) (numfield nonempty-type-eq-decl nil number_fields nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (>= const-decl "bool" reals nil) (nonneg_int nonempty-type-eq-decl nil integers nil) (posnat nonempty-type-eq-decl nil integers nil) (above nonempty-type-eq-decl nil integers nil) (= const-decl "[T, T -> boolean]" equalities nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (below type-eq-decl nil naturalnumbers nil) (<= const-decl "bool" reals nil) (upto nonempty-type-eq-decl nil naturalnumbers nil) (- const-decl "[numfield, numfield -> numfield]" number_fields nil) (int_minus_int_is_int application-judgement "int" integers nil)) nil)) (switch_one_entry_TCC1 0 (switch_one_entry_TCC1-1 nil 3621672198 ("" (subtype-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans nil) (number nonempty-type-decl nil numbers nil) (PRED type-eq-decl nil defined_types nil) (list type-decl nil list_adt nil) (every adt-def-decl "boolean" list_adt nil) (AND const-decl "[bool, bool -> bool]" booleans 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) (>= const-decl "bool" reals nil) (< const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (below type-eq-decl nil naturalnumbers nil) (cons? adt-recognizer-decl "[list -> boolean]" list_adt nil) (length def-decl "nat" list_props nil) (/= const-decl "boolean" notequal nil)) nil)) (switch_one_entry_TCC2 0 (switch_one_entry_TCC2-1 nil 3621672198 ("" (skeep) (("" (split 1) (("1" (ground) (("1" (grind) nil nil)) nil) ("2" (skeep) (("2" (grind) nil nil)) nil)) nil)) nil) ((nnint_plus_posint_is_posint application-judgement "posint" integers nil) (length def-decl "nat" list_props nil) (int_minus_int_is_int application-judgement "int" integers nil) (nth def-decl "T" list_props nil)) nil)) (switch_one_entry_TCC3 0 (switch_one_entry_TCC3-1 nil 3621672198 ("" (skeep) (("" (grind) (("" (typepred (L)) (("" (grind) (("" (typepred (n)) (("" (grind) nil nil)) nil)) nil)) nil)) nil)) nil) ((real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil) (length def-decl "nat" list_props nil) (boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans nil) (number nonempty-type-decl nil numbers nil) (PRED type-eq-decl nil defined_types nil) (list type-decl nil list_adt nil) (every adt-def-decl "boolean" list_adt nil) (AND const-decl "[bool, bool -> bool]" booleans 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) (>= const-decl "bool" reals nil) (< const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (below type-eq-decl nil naturalnumbers nil) (cons? adt-recognizer-decl "[list -> boolean]" list_adt nil)) nil)) (switch_one_entry_TCC4 0 (switch_one_entry_TCC4-1 nil 3621672198 ("" (skeep) (("" (typepred (n)) (("" (grind) nil nil)) nil)) nil) ((cons? adt-recognizer-decl "[list -> boolean]" list_adt nil) (length def-decl "nat" list_props nil) (below type-eq-decl nil naturalnumbers nil) (AND const-decl "[bool, bool -> bool]" booleans nil) (every adt-def-decl "boolean" list_adt nil) (PRED type-eq-decl nil defined_types nil) (list type-decl nil list_adt nil) (nat nonempty-type-eq-decl nil naturalnumbers 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) (< 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) (NOT const-decl "[bool -> bool]" booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (boolean nonempty-type-decl nil booleans nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (int_minus_int_is_int application-judgement "int" integers nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil)) nil)) (switch_one_entry_TCC5 0 (switch_one_entry_TCC5-1 nil 3621672198 ("" (termination-tcc) nil nil) nil nil)) (switch_one_entry_TCC6 0 (switch_one_entry_TCC6-1 nil 3621672198 ("" (skeep) (("" (split 2) (("1" (grind) nil nil) ("2" (skeep) (("2" (typepred "v(cdr[below(3)](L), n-1, new)") (("1" (inst -3 "i-1") (("1" (grind) (("1" (expand "nth" 2 1) (("1" (lift-if 2) (("1" (split 2) (("1" (flatten) (("1" (ground) nil nil)) nil) ("2" (flatten) (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil) ("2" (grind) (("2" (typepred (L)) (("2" (typepred (i)) (("2" (grind) nil nil)) nil)) nil)) nil)) nil) ("2" (typepred (n)) (("2" (grind) nil nil)) nil) ("3" (typepred (n)) (("3" (grind) nil nil)) nil)) nil)) nil)) nil)) nil) ((int_minus_int_is_int application-judgement "int" integers nil) (nnint_plus_posint_is_posint application-judgement "posint" integers nil) (length def-decl "nat" list_props nil) (- const-decl "[numfield, numfield -> numfield]" number_fields nil) (numfield nonempty-type-eq-decl nil number_fields nil) (cdr adt-accessor-decl "[(cons?) -> list]" list_adt nil) (nth def-decl "T" list_props nil) (below type-eq-decl nil nat_types nil) (/= const-decl "boolean" notequal nil) (IMPLIES const-decl "[bool, bool -> bool]" booleans nil) (= const-decl "[T, T -> boolean]" equalities nil) (cons? adt-recognizer-decl "[list -> boolean]" list_adt nil) (below type-eq-decl nil naturalnumbers nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (int nonempty-type-eq-decl nil integers nil) (< const-decl "bool" reals nil) (>= const-decl "bool" reals 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) (AND const-decl "[bool, bool -> bool]" booleans nil) (every adt-def-decl "boolean" list_adt nil) (list type-decl nil list_adt nil) (PRED type-eq-decl nil defined_types nil) (number nonempty-type-decl nil numbers nil) (NOT const-decl "[bool -> bool]" booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (boolean nonempty-type-decl nil booleans nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (i skolem-const-decl "below(length(L))" query_coeff nil) (L skolem-const-decl "{ll: list[below(3)] | cons?[below(3)](ll)}" query_coeff nil) (posint_plus_nnint_is_posint application-judgement "posint" integers nil)) nil)) (switch_is_with_TCC1 0 (switch_is_with_TCC1-1 nil 3621678714 ("" (existence-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans nil) (number nonempty-type-decl nil numbers nil) (PRED type-eq-decl nil defined_types nil) (list type-decl nil list_adt nil) (every adt-def-decl "boolean" list_adt nil) (AND const-decl "[bool, bool -> bool]" booleans 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) (>= const-decl "bool" reals nil) (< const-decl "bool" reals nil) (int nonempty-type-eq-decl nil integers nil) (nat nonempty-type-eq-decl nil naturalnumbers nil) (below type-eq-decl nil naturalnumbers nil) (cons? adt-recognizer-decl "[list -> boolean]" list_adt nil) (length def-decl "nat" list_props nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil)) nil)) (switch_is_with 0 (switch_is_with-1 nil 3621678727 ("" (case " FORALL (nn:posnat, L: list[below(3)], n: below(length(L)), new: below(3), (f: [nat -> below(3)] | array2list[below(3)](length(L))(f) = L)): nn = length(L) IMPLIES switch_one_entry(L, n, new) = array2list[below(3)](length(L))(f WITH [n := new])") (("1" (skeep) (("1" (inst?) (("1" (inst -1 "length(L)") nil nil)) nil)) nil) ("2" (hide 2) (("2" (induct "nn") (("1" (ground) nil nil) ("2" (ground) nil nil) ("3" (skeep) (("3" (skeep) (("3" (case-replace "j=0") (("1" (expand "switch_one_entry") (("1" (hide -2) (("1" (typepred (n)) (("1" (ground) (("1" (replace -4 :dir rl) (("1" (case-replace "n=0") (("1" (grind) (("1" (case "cdr(L) = null") (("1" (ground) nil nil) ("2" (grind) (("2" (expand "length") (("2" (ground) (("2" (grind) nil nil)) nil)) nil)) nil)) nil)) nil) ("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (case "n=0") (("1" (expand "switch_one_entry" 2) (("1" (ground) (("1" (expand "array2list" 2) (("1" (expand "array2list_it") (("1" (case-replace "cdr(L) = array2list_it(f WITH [n := new], length(L), 1)") (("1" (hide 3) (("1" (lemma "list_extensionality[below(3)]") (("1" (inst -1 "cdr(L)" " array2list_it(f WITH [n := new], length(L), 1)") (("1" (flatten) (("1" (hide -1) (("1" (split -1) (("1" (propax) nil nil) ("2" (typepred "array2list_it(f WITH [n := new], length(L), 1)") (("2" (replace -2) (("2" (ground) (("2" (typepred "cdr(L)") (("2" (expand "length" 1 2) (("2" (lift-if 1) (("2" (ground) (("2" (typepred (L)) (("2" (expand "length") (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("3" (skeep) (("3" (typepred "array2list_it(f WITH [n := new], length(L), 1)") (("3" (typepred (n_1)) (("3" (inst -4 "n_1+1") (("1" (replace -6) (("1" (ground) (("1" (replace -4 :dir rl) (("1" (typepred (f)) (("1" (case-replace "nth(cdr(L), n_1) = nth(L, n_1+1)") (("1" (replace -2 :dir rl) (("1" (hide 2) (("1" (typepred "array2list[below(3)](length(L))(f)") (("1" (inst -3 "n_1+1") (("1" (ground) nil nil) ("2" (ground) (("2" (expand "length" 1) (("2" (lift-if 1) (("2" (split 1) (("1" (flatten) (("1" (expand "length") (("1" (ground) nil nil)) nil)) nil) ("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (expand "nth" 1 2) (("2" (propax) nil nil)) nil) ("3" (expand "length" 1) (("3" (lift-if 1) (("3" (split 1) (("1" (flatten) (("1" (expand "length") (("1" (ground) nil nil)) nil)) nil) ("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (expand "length" 1) (("2" (lift-if 1) (("2" (split 1) (("1" (flatten) (("1" (expand "length") (("1" (ground) nil nil)) nil)) nil) ("2" (flatten) (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (expand "switch_one_entry" 3) (("2" (ground) (("2" (expand "array2list" 3) (("2" (expand "array2list_it") (("2" (typepred (f)) (("2" (case-replace "f(0) = car(L)") (("1" (case-replace "switch_one_entry(cdr(L), n - 1, new) = array2list_it(f WITH [n := new], length( (("1" (hide 4) (("1" (lemma "list_extensionality[below(3)]") (("1" (hide -2) (("1" (inst?) (("1" (flatten) (("1" (hide -1) (("1" (split -1) (("1" (propax) nil nil) ("2" (typepred "array2list_it(f WITH [n:=new], length(L), 1)") (("2" (replace -2) (("2" (hide 2) (("2" (expand "length" 1 2) (("2" (lift-if) (("2" (split 1) (("1" (flatten) (("1" (ground) (("1" (expand "length") (("1" (ground) nil nil)) nil)) nil)) nil) ("2" (flatten) (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("3" (typepred "array2list_it(f WITH [n := new], length(L), 1)") (("3" (skeep) (("3" (inst -3 "n_1+1") (("1" (replace -3 :dir rl) (("1" (typepred "switch_one_entry(cdr(L), n - 1, new)") (("1" (inst -3 "n_1") (("1" (typepred (n_1)) (("1" (case "n_1/=n-1") (("1" (ground) (("1" (replace -1) (("1" (typepred (f)) (("1" (case-replace "nth(cdr(L), n_1) = nth(L, n_1+1)") (("1" (typepred (n_1)) (("1" (typepred "array2list[below(3)](length(L))(f)") (("1" (inst -3 "n_1+1") (("1" (replace -6) (("1" (ground) nil nil)) nil)) nil)) nil)) nil) ("2" (expand "nth" 1 2) (("2" (propax) nil nil)) nil) ("3" (expand "length" 1) (("3" (lift-if 1) (("3" (split 1) (("1" (flatten) (("1" (expand "length") (("1" (ground) nil nil)) nil)) nil) ("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -4) (("2" (ground) (("2" (replace -1) (("2" (case "FORALL (mm:posnat, ll:{lll:list[below(3)]|cons?(lll) AND length(lll) =mm}, m:be nth(switch_one_entry(ll, m, new), m) = new") (("1" (inst -1 "length(cdr(L))" "cdr(L)" "n-1") nil nil) ("2" (hide-all-but 1) (("2" (induct "mm") (("1" (ground) nil nil) ("2" (ground) nil nil) ("3" (skeep) (("3" (skeep) (("3" (case "j!1=0") (("1" (case-replace "m=0") (("1" (expand "switch_one_entry") (("1" (expand "nth") (("1" (propax) nil nil)) nil)) nil) ("2" (typepred (m)) (("2" (ground) nil nil)) nil)) nil) ("2" (case "m=0") (("1" (replace -1) (("1" (expand "switch_one_entry") (("1" (expand "nth") (("1" (propax) nil nil)) nil)) nil)) nil) ("2" (expand "switch_one_entry" 3) (("2" (ground) (("2" (expand "nth" 3) (("2" (inst -1 "cdr(ll)" "m-1") (("2" (typepred (ll)) (("2" (expand "length" -3) (("2" (ground) (("2" (expand "length") (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("4" (skeep) (("4" (skeep) (("4" (typepred (ll)) (("4" (typepred "switch_one_entry(ll, m, new)") (("4" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil) ("3" (hide -) (("3" (skeep) (("3" (typepred (m)) (("3" (typepred "mm") (("3" (typepred (ll)) (("3" (typepred "switch_one_entry(ll, m, new)") (("3" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (expand "length") (("2" (lift-if) (("2" (split) (("1" (flatten) (("1" (ground) nil nil)) nil) ("2" (flatten) (("2" (typepred (n_1)) (("2" (ground) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide 4) (("2" (typepred "array2list[below(3)](length(L))(f)") (("2" (inst -3 "0") (("2" (ground) (("2" (replace -4) (("2" (expand "nth") (("2" (propax) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) --> -------------------- --> maximum size reached --> -------------------- ¤ Dauer der Verarbeitung: 0.88 Sekunden (vorverarbeitet) ¤ |
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 ist noch experimentell.Bot Zugriff |
