Quellcode-Bibliothek orthogonality.prf
Sprache: Lisp
(mem_test
(member_seq_in_seq2set 0
(member_seq_in_seq2set-1 nil 3569253011
("" (skeep) (("" (grind) nil 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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(below type-eq-decl nil nat_types nil )
(finseq type-eq-decl nil finite_sequences nil )
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(below type-eq-decl nil naturalnumbers nil )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(member_seq const-decl "bool" mem_test nil )
(T formal-type-decl nil mem_test nil )
(seq2set const-decl "finite_set[T]" seq2set "structures/" ))
shostak))
(subseq_rest 0
(subseq_rest-1 nil 3569226615
("" (skeep)
(("" (expand subseq)
(("" (skeep)
(("" (inst -1 i)
(("" (expand member_seq)
(("" (expand finseq_appl)
(("" (skosimp)
(("" (typepred i!1)
(("" (expand rest (-1 -2))
(("" (expand * ^ min )
(("" (expand empty_seq -1)
(("" (lift-if)
(("" (assert )
(("" (prop) (("" (inst 7 "1+i!1" ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((subseq const-decl "bool" mem_test nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(T formal-type-decl nil mem_test nil )
(finseq type-eq-decl nil finite_sequences nil )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(rest const-decl "finseq" seq_extras "structures/" )
(min const-decl "{p: real | p <= m AND p <= n}" real_defs nil )
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil )
(^ const-decl "finseq" finite_sequences nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(empty_seq const-decl "finseq" finite_sequences nil )
(member_seq const-decl "bool" mem_test nil ))
shostak))
(seq2set_comp 0
(seq2set_comp-1 nil 3569231569
("" (skeep)
(("" (split)
(("1" (flatten)
(("1" (expand o)
(("1" (expand seq2set)
(("1" (expand finseq_appl)
(("1" (skosimp)
(("1" (lift-if)
(("1" (prop)
(("1" (inst 1 kk!1) nil nil )
("2" (inst 3 "kk!1 - seq1`length" )
(("2" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (flatten)
(("2" (expand o)
(("2" (expand seq2set)
(("2" (expand finseq_appl)
(("2" (split)
(("1" (skosimp)
(("1" (inst 1 kk!1)
(("1" (lift-if) (("1" (assert ) nil nil )) nil )
("2" (assert ) nil nil ))
nil ))
nil )
("2" (skosimp)
(("2" (inst 1 "kk!1+seq1`length" )
(("2" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((O const-decl "finseq" finite_sequences nil )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(int_minus_int_is_int application-judgement "int" integers nil )
(- const-decl "[numfield, numfield -> numfield]" number_fields nil )
(kk!1 skolem-const-decl "below(seq1`length + seq2`length)" mem_test
nil )
(seq2 skolem-const-decl "finseq[T]" mem_test nil )
(seq1 skolem-const-decl "finseq[T]" mem_test nil )
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(T formal-type-decl nil mem_test nil )
(finseq type-eq-decl nil finite_sequences nil )
(below type-eq-decl nil naturalnumbers nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(seq2set const-decl "finite_set[T]" seq2set "structures/" )
(kk!1 skolem-const-decl "below(length(seq1))" mem_test nil )
(nnint_plus_nnint_is_nnint application-judgement "nonneg_int"
integers nil ))
shostak))
(seq_construct_TCC1 0
(seq_construct_TCC1-1 nil 3575042025 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(below type-eq-decl nil nat_types nil )
(< const-decl "bool" reals nil ))
nil ))
(seq_construct_TCC2 0
(seq_construct_TCC2-1 nil 3575042025 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(below type-eq-decl nil nat_types nil )
(< const-decl "bool" reals nil ))
nil ))
(seq_construct_TCC3 0
(seq_construct_TCC3-1 nil 3575042025 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(seq_construct_TCC4 0
(seq_construct_TCC4-1 nil 3575042025 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(seq_construct_TCC5 0
(seq_construct_TCC5-1 nil 3575042025 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(seq_construct 0
(seq_construct-1 nil 3575042028
("" (induct n)
(("1" (skeep)
(("1" (inst 1 empty_seq)
(("1" (expand empty_seq 1 1) (("1" (skeep) nil nil )) nil ))
nil ))
nil )
("2" (skeep)
(("2" (skeep)
(("2" (inst -1 P "rest(seq1)" "rest(seq2)" )
(("2" (prop)
(("1" (inst -4 0)
(("1" (skosimp*)
(("1" (inst 1 "add_first(x!1, seq!1)" )
(("1" (expand * add_first insert? finseq_appl)
(("1" (assert )
(("1" (skeep)
(("1" (lift-if)
(("1" (case "i=0" )
(("1" (assert ) nil nil )
("2" (assert )
(("2"
(inst -2 i-1)
(("2"
(expand rest -2)
(("2"
(expand * ^ min empty_seq)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide-all-but (-1 1)) (("2" (grind) nil nil )) nil )
("3" (hide-all-but (-2 1)) (("3" (grind) nil nil )) nil )
("4" (hide 2)
(("4" (skeep)
(("4" (typepred i)
(("4" (expand * rest ^ min empty_seq)
(("4" (assert ) (("4" (inst -4 1+i) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (hide 2)
(("3" (skeep)
(("3" (skeep) (("3" (skeep) (("3" (assert ) nil nil )) nil ))
nil ))
nil ))
nil )
("4" (hide 2)
(("4" (skeep)
(("4" (skeep) (("4" (skeep) (("4" (assert ) nil nil )) nil ))
nil ))
nil ))
nil )
("5" (hide 2)
(("5" (skeep) (("5" (skeep) (("5" (assert ) nil nil )) nil )) nil ))
nil )
("6" (hide 2)
(("6" (skeep) (("6" (skeep) (("6" (assert ) nil nil )) nil )) nil ))
nil )
("7" (hide 2) (("7" (skeep) (("7" (assert ) nil nil )) nil )) nil )
("8" (hide 2) (("8" (skeep) (("8" (assert ) nil nil )) nil )) nil ))
nil )
((rest const-decl "finseq" seq_extras "structures/" )
(NOT const-decl "[bool -> bool]" booleans nil )
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(min const-decl "{p: real | p <= m AND p <= n}" real_defs nil )
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil )
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(add_first const-decl "finseq" seq_extras "structures/" )
(nnint_plus_posint_is_posint application-judgement "posint"
integers nil )
(int_minus_int_is_int application-judgement "int" integers nil )
(^ const-decl "finseq" finite_sequences nil )
(- const-decl "[numfield, numfield -> numfield]" number_fields nil )
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(insert? const-decl "finseq" seq_extras "structures/" )
(empty_seq const-decl "finseq" finite_sequences nil )
(nat_induction formula-decl nil naturalnumbers nil )
(pred type-eq-decl nil defined_types nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(below type-eq-decl nil nat_types nil )
(T formal-type-decl nil mem_test nil )
(finseq type-eq-decl nil finite_sequences nil )
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(< const-decl "bool" reals nil ))
shostak))
(seq_construct2_TCC1 0
(seq_construct2_TCC1-1 nil 3575131546 ("" (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 )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(seq_construct2 0
(seq_construct2-1 nil 3575131579
("" (induct n)
(("1" (skeep)
(("1" (inst 1 empty_seq)
(("1" (expand empty_seq 1 1) (("1" (skeep) nil nil )) nil ))
nil ))
nil )
("2" (skeep)
(("2" (skeep)
(("2" (inst -1 P1)
(("2" (prop)
(("1" (skosimp)
(("1" (inst -3 j)
(("1" (skosimp)
(("1" (inst 1 "add_last(seq!1, x!1)" )
(("1" (expand * add_last insert? finseq_appl)
(("1" (assert )
(("1" (skeep)
(("1" (lift-if)
(("1" (prop)
(("1"
(inst -3 i)
(("1" (assert ) nil nil ))
nil )
("2"
(typepred i)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide 2)
(("2" (skeep) (("2" (inst -1 i) nil nil )) nil )) nil ))
nil ))
nil ))
nil ))
nil )
("3" (hide 2)
(("3" (skeep) (("3" (skeep) (("3" (assert ) nil nil )) nil )) nil ))
nil ))
nil )
((insert? const-decl "finseq" seq_extras "structures/" )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(i skolem-const-decl "below[1 + j]" mem_test nil )
(j skolem-const-decl "nat" mem_test nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(add_last const-decl "finseq" seq_extras "structures/" )
(numfield nonempty-type-eq-decl nil number_fields nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields 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 )
(empty_seq const-decl "finseq" finite_sequences nil )
(nat_induction formula-decl nil naturalnumbers nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(pred type-eq-decl nil defined_types nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(T formal-type-decl nil mem_test nil )
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil )
(< const-decl "bool" reals nil )
(below type-eq-decl nil nat_types nil )
(finseq type-eq-decl nil finite_sequences nil )
(= const-decl "[T, T -> boolean]" equalities nil ))
shostak)))
(orthogonality
(IMP_critical_pairs_TCC1 0
(IMP_critical_pairs_TCC1-1 nil 3581385367
("" (rewrite "var_countable" ) nil nil )
((var_countable formula-decl nil orthogonality nil )) nil ))
(ntCP?_TCC1 0
(ntCP?_TCC1-1 nil 3581173294
("" (skosimp*)
(("" (hide-all-but 3)
(("" (typepred "p!1" ) (("" (rewrite "ext_preserv_pos" ) nil nil ))
nil ))
nil ))
nil )
((ext_preserv_pos formula-decl nil substitution nil )
(V const-decl "set[term]" variables_term nil )
(Sub? const-decl "bool" substitution nil )
(Sub type-eq-decl nil substitution nil )
(boolean nonempty-type-decl nil booleans nil )
(bool nonempty-type-eq-decl nil booleans nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality 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 )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(term type-decl nil term_adt nil )
(below type-eq-decl nil nat_types nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(posnat nonempty-type-eq-decl nil integers nil )
(position type-eq-decl nil positions nil )
(positions type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(rewrite_rule? const-decl "bool" rewrite_rules nil )
(rewrite_rule type-eq-decl nil rewrite_rules nil )
(lhs const-decl "term" rewrite_rules nil )
(set type-eq-decl nil sets nil ) (member const-decl "bool" sets nil )
(positions? type-eq-decl nil positions nil ))
nil ))
(ntCP_lemma_aux1_TCC1 0
(ntCP_lemma_aux1_TCC1-1 nil 3581173294
("" (skosimp*)
(("" (hide-all-but (-1 3))
(("" (rewrite "ext_preserv_pos" ) nil nil )) nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(Sub type-eq-decl nil substitution nil )
(Sub? const-decl "bool" substitution nil )
(V const-decl "set[term]" variables_term nil )
(member const-decl "bool" sets nil ) (set type-eq-decl nil sets nil )
(lhs const-decl "term" rewrite_rules nil )
(rewrite_rule type-eq-decl nil rewrite_rules nil )
(rewrite_rule? const-decl "bool" rewrite_rules nil )
(term type-decl nil term_adt nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil )
(ext_preserv_pos formula-decl nil substitution nil ))
nil ))
(ntCP_lemma_aux1 0
(ntCP_lemma_aux1-1 nil 3581173357
("" (skosimp*)
(("" (lemma "CP_lemma_aux1a" )
(("" (inst?)
(("" (assert )
(("" (skosimp*)
((""
(case "ext(union_subs((restriction(sg1!1)(Vars(lhs(e1!1))), restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))))(subtermOF(lhs(e1!1), p!1)) = ext(union_subs((restriction(sg1!1)(Vars(lhs(e1!1))), restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))))(ext(rho!1)(lhs(e2!1)))" )
(("1" (lemma "unification" )
(("1"
(inst -1 "subtermOF(lhs(e1!1), p!1)"
"ext(rho!1)(lhs(e2!1))" )
(("1" (hide 2)
(("1" (prop)
(("1" (skosimp*)
(("1" (copy -1)
(("1" (expand "mgu" -1)
(("1" (flatten)
(("1"
(hide -1)
(("1"
(inst
-1
"union_subs(restriction(sg1!1)(Vars(lhs(e1!1))), restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))" )
(("1"
(expand "member" -1)
(("1"
(expand "U" -1)
(("1"
(expand "unifier" -1)
(("1"
(assert )
(("1"
(expand "<=" )
(("1"
(skosimp*)
(("1"
(inst
2
"ext(theta!1)(rhs(e1!1))"
"replaceTerm(ext(theta!1)(lhs(e1!1)), ext(theta!1)(ext(rho!1)(rhs(e2!1))),p!1)"
"tau!1" )
(("1"
(lemma "ext_o" )
(("1"
(inst
-1
"tau!1"
"theta!1" )
(("1"
(decompose-equality
-1)
(("1"
(split)
(("1"
(hide -1)
(("1"
(expand
"ntCP?" )
(("1"
(inst
1
"theta!1"
"rho!1"
"e1!1"
"e2!1"
"p!1" )
(("1"
(assert )
(("1"
(reveal
3)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(inst
-1
"rhs(e1!1)" )
(("2"
(expand
"o" )
(("2"
(replace
-1
1
rl)
(("2"
(hide
-1)
(("2"
(replace
-1
1
rl)
(("2"
(hide
-1)
(("2"
(lemma
"restriction_union" )
(("2"
(inst
-1
"restriction(sg1!1)(Vars(lhs(e1!1)))"
"restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))"
"rhs(e1!1)" )
(("1"
(lemma
"dom_restriction" )
(("1"
(copy
-1)
(("1"
(inst
-1
"Vars(lhs(e1!1))"
"sg1!1" )
(("1"
(inst
-2
"Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1" )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1"
(assert )
(("1"
(prop)
(("1"
(replace
-1
1)
(("1"
(lemma
"restriction_term" )
(("1"
(inst?)
(("1"
(prop)
(("1"
(assert )
nil
nil )
("2"
(hide-all-but
1)
(("2"
(typepred
"e1!1" )
(("2"
(expand
"rewrite_rule?" )
(("2"
(expand *
"lhs"
"rhs" )
(("2"
(prop)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-2
-3
-6
1))
(("2"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("2"
(inst
-1
"Vars(rhs(e1!1))"
"Vars(rhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("2"
(prop)
(("1"
(hide-all-but
1)
(("1"
(expand *
"subset?"
"member" )
(("1"
(skeep)
nil
nil ))
nil ))
nil )
("2"
(hide-all-but
(-3
1))
(("2"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("2"
(inst
-1
"Vars(rhs(e1!1))"
"Vars(lhs(e1!1))"
"Vars(ext(rho!1)(lhs(e2!1)))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("2"
(prop)
(("1"
(hide
(-1
2))
(("1"
(typepred
"e1!1" )
(("1"
(expand *
"rewrite_rule?"
"lhs"
"rhs" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil )
("2"
(hide
(-1
2))
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(rewrite
"restriction_Subs" )
nil
nil )
("3"
(rewrite
"restriction_Subs" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(lemma
"ext_replace_ext" )
(("3"
(inst?)
(("3"
(prop)
(("1"
(replaces
-1)
(("1"
(copy
-1)
(("1"
(inst
-1
"ext(rho!1)(rhs(e2!1))" )
(("1"
(inst
-2
"lhs(e1!1)" )
(("1"
(expand
"o" )
(("1"
(replace
-1
1
rl)
(("1"
(replace
-2
1
rl)
(("1"
(replace
-3
1
rl)
(("1"
(hide
(-1
-2
-3))
(("1"
(lemma
"restriction_union" )
(("1"
(copy
-1)
(("1"
(inst
-1
"restriction(sg1!1)(Vars(lhs(e1!1)))"
"restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))"
"lhs(e1!1)" )
(("1"
(inst
-2
"restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))"
"restriction(sg1!1)(Vars(lhs(e1!1)))"
"ext(rho!1)(rhs(e2!1))" )
(("1"
(lemma
"dom_restriction" )
(("1"
(copy
-1)
(("1"
(inst
-1
"Vars(lhs(e1!1))"
"sg1!1" )
(("1"
(inst
-2
"Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1" )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1"
(assert )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))" )
(("1"
(assert )
(("1"
(prop)
(("1"
(rewrite
"union_commute" )
(("1"
(replaces
-1)
(("1"
(replaces
-1)
(("1"
(lemma
"restriction_term" )
(("1"
(copy
-1)
(("1"
(inst
-1
"Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1"
"ext(rho!1)(rhs(e2!1))" )
(("1"
(inst
-2
"Vars(lhs(e1!1))"
"sg1!1"
"lhs(e1!1)" )
(("1"
(prop)
(("1"
(replace
-1
1
rl)
(("1"
(replace
-2
1
rl)
(("1"
(rewrite
"ext_o" )
(("1"
(expand
"o" )
(("1"
(case-replace
"ext(alpha!1)(ext(rho!1)(rhs(e2!1))) = ext(sg2!1)(rhs(e2!1))" )
(("1"
(hide-all-but
(-10
-12
1))
(("1"
(replaces
-1)
(("1"
(lemma
"ext_o" )
(("1"
(inst
-1
"alpha!1"
"rho!1" )
(("1"
(copy
-1)
(("1"
(decompose-equality
-1)
(("1"
(decompose-equality
-2)
(("1"
(inst
-1
"lhs(e2!1)" )
(("1"
(inst
-2
"rhs(e2!1)" )
(("1"
(expand
"o" )
(("1"
(replace
-1
*
rl)
(("1"
(replace
-2
*
rl)
(("1"
(hide
(-1
-2))
(("1"
(lemma
"same_substitution" )
(("1"
(inst
-1
"comp(alpha!1, rho!1)"
"sg2!1"
"lhs(e2!1)" )
(("1"
(assert )
(("1"
(lemma
"same_term" )
(("1"
(inst
-1
"comp(alpha!1, rho!1)"
"sg2!1"
"rhs(e2!1)" )
(("1"
(prop)
(("1"
(skosimp*)
(("1"
(hide
(-3
2))
(("1"
(inst
-2
"x!1" )
(("1"
(assert )
(("1"
(hide
1)
(("1"
(typepred
"e2!1" )
(("1"
(hide
-2)
(("1"
(expand
"rewrite_rule?" )
(("1"
(flatten)
(("1"
(expand *
"subset?"
"rhs"
"lhs" )
(("1"
(inst?)
(("1"
(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 ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil )
("3"
(hide-all-but
1)
(("3"
(typepred
"e2!1" )
(("3"
(expand
"rewrite_rule?" )
(("3"
(flatten)
(("3"
(lemma
"rename_preserv_inclusion" )
(("3"
(expand *
"rhs"
"lhs" )
(("3"
(inst?)
(("3"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4"
(hide-all-but
1)
(("4"
(expand *
"subset?"
"member" )
(("4"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-4
-8
1))
(("2"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("2"
(case
"disjoint?(Vars(lhs(e1!1)), Vars(ext(rho!1)(rhs(e2!1))))" )
(("1"
(inst
-2
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Vars(ext(rho!1)(rhs(e2!1)))"
"Vars(ext(rho!1)(rhs(e2!1)))" )
(("1"
(prop)
(("1"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(ext(rho!1)(rhs(e2!1)))" )
(("1"
(assert )
nil
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-1
-3
1))
(("2"
(typepred
"e2!1" )
(("2"
(expand
"rewrite_rule?" )
(("2"
(flatten)
(("2"
(expand *
"lhs"
"rhs" )
(("2"
(lemma
"rename_preserv_inclusion" )
(("2"
(inst
-1
"rho!1"
"e2!1`1"
"e2!1`2" )
(("2"
(assert )
(("2"
(inst
-4
"Vars(e1!1`1)"
"Vars(e1!1`1)"
"Vars(ext(rho!1)(e2!1`2))"
"Vars(ext(rho!1)(e2!1`1))" )
(("2"
(prop)
(("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(hide-all-but
(-5
-8
1))
(("3"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("3"
(inst
-1
"Vars(lhs(e1!1))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("3"
(prop)
(("3"
(hide-all-but
1)
(("3"
(expand *
"subset?"
"member" )
(("3"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4"
(hide-all-but
(-3
-7
1))
(("4"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("4"
(case
"disjoint?(Vars(ext(rho!1)(rhs(e2!1))), Vars(lhs(e1!1)))" )
(("1"
(inst
-2
"Vars(ext(rho!1)(rhs(e2!1)))"
"Vars(ext(rho!1)(rhs(e2!1)))"
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))" )
(("1"
(prop)
(("1"
(hide-all-but
1)
(("1"
(expand *
"subset?"
"member" )
(("1"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
(-2
2))
(("2"
(typepred
"e2!1" )
(("2"
(expand
"rewrite_rule?" )
(("2"
(flatten)
(("2"
(lemma
"rename_preserv_inclusion" )
(("2"
(inst
-1
"rho!1"
"e2!1`1"
"e2!1`2" )
(("2"
(assert )
(("2"
(inst
-4
"Vars(e1!1`1)"
"Vars(e1!1`1)"
"Vars(ext(rho!1)(e2!1`2))"
"Vars(ext(rho!1)(e2!1`1))" )
(("2"
(prop)
(("1"
(expand *
"rhs"
"lhs" )
(("1"
(hide-all-but
(-1
2))
(("1"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("1"
(inst
-1
"Vars(e1!1`1)"
"Vars(ext(rho!1)(e2!1`2))" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil )
("3"
(expand *
"rhs"
"lhs" )
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 )
("2"
(hide-all-but
1)
(("2"
(rewrite
"restriction_Subs" )
nil
nil ))
nil )
("3"
(hide-all-but
1)
(("3"
(rewrite
"restriction_Subs" )
nil
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
"restriction_Subs" )
nil
nil ))
nil )
("3"
(hide-all-but
1)
(("3"
(rewrite
"restriction_Subs" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-7
1))
(("2"
(rewrite
"ext_preserv_pos" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but (-6 1))
(("2"
(rewrite
"ext_preserv_pos" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but 1)
(("2"
(rewrite "restriction_Subs" )
nil
nil ))
nil )
("3"
(hide-all-but 1)
(("3"
(rewrite "restriction_Subs" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide-all-but (-1 1))
(("2" (expand "unifiable" )
(("2"
(inst 1
"union_subs((restriction(sg1!1)(Vars(lhs(e1!1))), restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))))" )
(("1" (expand "unifier" )
(("1" (propax) nil nil )) nil )
("2" (hide-all-but 1)
(("2"
(rewrite "restriction_Subs" )
nil
nil ))
nil )
("3" (hide-all-but 1)
(("3"
(rewrite "restriction_Subs" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide 3 4)
(("2" (lemma "restriction_union" )
(("2"
(inst -1 "restriction(sg1!1)(Vars(lhs(e1!1)))"
"restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))"
"subtermOF(lhs(e1!1), p!1)" )
(("1" (lemma "dom_restriction" )
(("1" (inst -1 "Vars(lhs(e1!1))" "sg1!1" )
(("1"
(lemma "IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst -1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1" (lemma "dom_restriction" )
(("1"
(inst
-1
"Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1" )
(("1"
(assert )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst
-1
"Vars(lhs(e1!1))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1"
(prop)
(("1"
(replaces -1)
(("1"
(lemma "restriction_union" )
(("1"
(inst
-1
"restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1))))"
"restriction(sg1!1)(Vars(lhs(e1!1)))"
"ext(rho!1)(lhs(e2!1))" )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))" )
(("1"
(assert )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Vars(ext(rho!1)(lhs(e2!1)))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1"
(assert )
(("1"
(prop)
(("1"
(rewrite
"union_commute" )
(("1"
(replaces
-1)
(("1"
(lemma
"restriction_term" )
(("1"
(inst?)
(("1"
(prop)
(("1"
(replace
-1
1
rl)
(("1"
(lemma
"restriction_term" )
(("1"
(inst
-1
"Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1"
"ext(rho!1)(lhs(e2!1))" )
(("1"
(prop)
(("1"
(replace
-1
1
rl)
(("1"
(rewrite
"ext_o" )
(("1"
(expand
"o" )
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
"vars_subterm" )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-1 1))
(("2"
(rewrite
"IUnion_extra[(V)].disjoint_commute" )
nil
nil ))
nil )
("3"
(hide-all-but
1)
(("3"
(expand *
"subset?"
"member" )
(("3"
(skeep)
nil
nil ))
nil ))
nil )
("4"
(hide-all-but
(-5
-6
1))
(("4"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("4"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Vars(ext(rho!1)(lhs(e2!1)))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("4"
(assert )
(("4"
(prop)
(("1"
(hide
(-2
-3))
(("1"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("1"
(inst
-1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil )
("2"
(hide
(-1
-2
2))
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but 1)
(("2"
(rewrite
"restriction_Subs" )
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but (-1 1))
(("2"
(lemma "vars_subterm" )
(("2"
(inst?)
(("2"
(assert )
(("2"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("2"
(inst
-1
"Vars(subtermOF(lhs(e1!1), p!1))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))" )
(("2"
(prop)
(("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(hide-all-but 1)
(("3"
(expand *
"subset?"
"member" )
(("3" (skeep) nil nil ))
nil ))
nil )
("4"
(hide-all-but (-1 -4 1))
(("4"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("4"
(inst
-1
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))"
"Vars(lhs(e1!1))"
"Vars(lhs(e1!1))" )
(("4"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("4"
(inst?)
(("4"
(assert )
(("4"
(prop)
(("1"
(hide
(-2 -3 -4))
(("1"
(lemma
"vars_subterm" )
(("1"
(inst?)
(("1"
(assert )
(("1"
(lemma
"IUnion_extra[(V)].disjoint_subset" )
(("1"
(inst
-1
"Vars(subtermOF(lhs(e1!1), p!1))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))" )
(("1"
(prop)
(("1"
(hide-all-but
1)
(("1"
(expand *
"subset?"
"member" )
(("1"
(skeep)
nil
nil ))
nil ))
nil )
("2"
(hide
(-1
2))
(("2"
(lemma
"IUnion_extra[(V)].disjoint_commute" )
(("2"
(inst?)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(expand *
"subset?"
"member" )
(("2"
(skeep)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (hide-all-but 1)
(("2" (rewrite "restriction_Subs" ) nil nil )) nil )
("3" (hide-all-but 1)
(("3" (rewrite "restriction_Subs" ) nil nil ))
nil ))
nil ))
nil ))
nil )
("3" (hide-all-but 1)
(("3" (rewrite "union_is_sub" )
(("1" (hide 2)
(("1" (rewrite "restriction_Subs" ) nil nil )) nil )
("2" (hide 2)
(("2" (rewrite "restriction_Subs" ) nil nil )) nil ))
nil ))
nil )
("4" (hide-all-but (-1 1))
(("4" (expand "disjoint_D?" )
(("4" (lemma "dom_restriction" )
(("4" (copy -1)
(("4" (inst -1 "Vars(lhs(e1!1))" "sg1!1" )
(("4"
(inst -2 "Vars(ext(rho!1)(lhs(e2!1)))"
"alpha!1" )
(("4"
(lemma "IUnion_extra[(V)].disjoint_subset" )
(("4"
(inst -1
"Dom(restriction(sg1!1)(Vars(lhs(e1!1))))"
"Vars(lhs(e1!1))"
"Dom(restriction(alpha!1)(Vars(ext(rho!1)(lhs(e2!1)))))"
"Vars(ext(rho!1)(lhs(e2!1)))" )
(("4" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("5" (hide-all-but 1)
(("5" (rewrite "restriction_Subs" ) nil nil )) nil )
("6" (hide-all-but 1)
(("6" (rewrite "restriction_Subs" ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(CP_lemma_aux1a formula-decl nil critical_pairs nil )
(subtermOF def-decl "term" subterm nil )
(positions? type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(positions type-eq-decl nil positions nil )
(Ren type-eq-decl nil substitution nil )
(Ren? const-decl "bool" substitution nil )
(lhs const-decl "term" rewrite_rules nil )
(Vars const-decl "set[(V)]" subterm nil )
(restriction const-decl "term" substitution nil )
(union_subs const-decl "term" substitution nil )
(disjoint_D type-eq-decl nil substitution nil )
(disjoint_D? const-decl "bool" substitution nil )
(ext def-decl "term" substitution nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(sg1!1 skolem-const-decl "Sub[variable, symbol, arity]"
orthogonality nil )
(E!1 skolem-const-decl "set[rewrite_rule[variable, symbol, arity]]"
orthogonality nil )
(e1!1 skolem-const-decl "{e1 | member(e1, E!1)}" orthogonality nil )
(alpha!1 skolem-const-decl "Sub[variable, symbol, arity]"
orthogonality nil )
(rho!1 skolem-const-decl "Ren[variable, symbol, arity]"
orthogonality nil )
(e2!1 skolem-const-decl "{e2 | member(e2, E!1)}" orthogonality nil )
(U const-decl "set[Sub]" unification nil )
(ext_o formula-decl nil substitution nil )
(O const-decl "T3" function_props nil )
(comp const-decl "term" substitution nil )
(ext_replace_ext formula-decl nil substitution nil )
(same_term formula-decl nil substitution nil )
(same_substitution formula-decl nil substitution nil )
(rename_preserv_inclusion formula-decl nil substitution nil )
(union_commute formula-decl nil substitution nil )
(disjoint? const-decl "bool" sets nil )
(disjoint_commute formula-decl nil IUnion_extra nil )
(ext_preserv_pos formula-decl nil substitution nil )
(restriction_union formula-decl nil substitution nil )
(restriction_Subs formula-decl nil substitution nil )
(dom_restriction formula-decl nil substitution nil )
(disjoint_subset formula-decl nil IUnion_extra nil )
(subset_is_partial_order name-judgement "(partial_order?[set[T]])"
sets_lemmas nil )
(subset? const-decl "bool" sets nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(restriction_term formula-decl nil substitution nil )
(Dom const-decl "set[(V)]" substitution nil )
(ntCP? const-decl "bool" orthogonality nil )
(rhs const-decl "term" rewrite_rules nil )
(replaceTerm def-decl "term" replacement nil )
(p!1 skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(theta!1 skolem-const-decl "Sub[variable, symbol, arity]"
orthogonality nil )
(<= const-decl "bool" unification nil )
(unifier const-decl "bool" unification nil )
(mgu const-decl "bool" unification nil )
(unifiable const-decl "bool" unification nil )
(unification formula-decl nil unification nil )
(vars_subterm formula-decl nil subterm nil )
(union_is_sub formula-decl nil substitution nil )
(member const-decl "bool" sets nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil )
(rewrite_rule type-eq-decl nil rewrite_rules nil )
(rewrite_rule? const-decl "bool" rewrite_rules nil )
(Sub type-eq-decl nil substitution nil )
(Sub? const-decl "bool" substitution nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil ))
shostak))
(linear?_TCC1 0
(linear?_TCC1-1 nil 3434983472
("" (skosimp)
(("" (lemma Pos_var_is_finite)
(("" (inst -1 t!1 x!1) (("" (assert ) nil nil )) nil )) nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(Pos_var_is_finite formula-decl nil subterm nil )
(Vars const-decl "set[(V)]" subterm nil )
(member const-decl "bool" sets nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil ))
nil ))
(Orth_lemma_aux0_TCC1 0
(Orth_lemma_aux0_TCC1-1 nil 3460213554
("" (skosimp)
(("" (lemma Pos_var_is_finite)
(("" (inst -1 t!1 x!1) (("" (assert ) nil nil )) nil )) nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(Pos_var_is_finite formula-decl nil subterm nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil ))
nil ))
(Orth_lemma_aux0 0
(Orth_lemma_aux0-1 nil 3460212656
("" (skeep)
(("" (lemma finite_sets[position].card_one)
(("" (inst -1 "Pos_var(t, x)" )
(("" (lemma finite_sets[position].card_def)
(("" (inst -1 "Pos_var(t, x)" )
(("" (replace -1 -3 rl)
(("" (assert )
(("" (skosimp)
(("" (inst 1 x!1)
(("" (expand singleton)
(("" (decompose-equality)
(("" (inst -1 x!1)
(("" (expand Pos_var -1)
(("" (expand extend) (("" (prop) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((position type-eq-decl nil positions nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality 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 "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(below type-eq-decl nil nat_types nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(card_one formula-decl nil finite_sets nil )
(card_def formula-decl nil finite_sets nil )
(singleton const-decl "(singleton?)" sets nil )
(extend const-decl "R" extend nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(Pos_var const-decl "positions" subterm nil )
(positions type-eq-decl nil positions nil )
(V const-decl "set[term]" variables_term nil )
(term type-decl nil term_adt 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 ))
shostak))
(equality_replaceTerm 0
(equality_replaceTerm-1 nil 3460128485
("" (skeep)
(("" (prop)
(("1" (replace -1 1) (("1" (propax) nil nil )) nil )
("2" (lemma subterm_of_replace)
(("2" (copy -1)
(("2" (inst -1 p s t1)
(("2" (inst -2 p s t2) (("2" (assert ) nil nil )) nil )) nil ))
nil ))
nil ))
nil ))
nil )
((term type-decl nil term_adt nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil )
(subterm_of_replace formula-decl nil replacement nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil ))
shostak))
(Var_occurs_only_once_also_in_subterms_TCC1 0
(Var_occurs_only_once_also_in_subterms_TCC1-1 nil 3466433636
("" (skosimp)
(("" (lemma seq_first_rest_1[posnat])
(("" (inst -1 p!1)
(("" (assert )
(("" (lemma pos_ax)
(("" (inst -1 "#(first(p!1))" "rest(p!1)" s!1)
(("" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
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 "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(seq_first_rest_1 formula-decl nil seq_extras "structures/" )
(finite_sequence type-eq-decl nil finite_sequences nil )
(|#| const-decl "finite_sequence[T]" set2seq "structures/" )
(/= const-decl "boolean" notequal nil )
(not_empty_seq type-eq-decl nil seq_extras "structures/" )
(first const-decl "T" seq_extras "structures/" )
(rest const-decl "finseq" seq_extras "structures/" )
(term type-decl nil term_adt nil )
(pos_ax formula-decl nil positions nil )
(position type-eq-decl nil positions nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(finseq type-eq-decl nil finite_sequences nil )
(below type-eq-decl nil nat_types nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil ))
nil ))
(Var_occurs_only_once_also_in_subterms_TCC2 0
(Var_occurs_only_once_also_in_subterms_TCC2-1 nil 3466433636
("" (skosimp)
(("" (lemma Pos_var_is_finite)
(("" (inst -1 "subtermOF(s!1, #(first(p!1)))" "x!1" )
(("" (assert ) nil nil )) nil ))
nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(Pos_var_is_finite formula-decl nil subterm nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil )
(first const-decl "T" seq_extras "structures/" )
(not_empty_seq type-eq-decl nil seq_extras "structures/" )
(/= const-decl "boolean" notequal nil )
(finseq type-eq-decl nil finite_sequences nil )
(|#| const-decl "finite_sequence[T]" set2seq "structures/" )
(finite_sequence type-eq-decl nil finite_sequences nil )
(subtermOF def-decl "term" subterm nil )
(positions? type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(positions type-eq-decl nil positions nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil )
(term type-decl nil term_adt nil ))
nil ))
(Var_occurs_only_once_also_in_subterms 0
(Var_occurs_only_once_also_in_subterms-1 nil 3467717493
("" (skeep)
(("" (case "card(Pos_var(subtermOF(s, #(first(p))), x)) >= 2" )
(("1" (lemma finite_sets[position].card_2_has_2)
(("1" (inst -1 "Pos_var(subtermOF(s, #(first(p))), x)" )
(("1" (assert )
(("1" (skosimp)
(("1" (case "member( #(first(p)) o x!1 , Pos_var(s,x))" )
(("1"
(case "member( #(first(p)) o y!1 , Pos_var(s,x))" )
(("1" (expand member)
(("1" (hide -3 -4 -5 3)
(("1" (expand Pos_var (-1 -2))
(("1" (expand extend)
(("1" (prop)
(("1" (rewrite card_one)
(("1"
(skosimp)
(("1"
(expand * Pos_var extend)
(("1"
(decompose-equality -8)
(("1"
(copy -1)
(("1"
(inst
-1
"add_first(first(p), x!1)" )
(("1"
(inst
-2
"add_first(first(p), y!1)" )
(("1"
(lift-if)
(("1"
(case
"add_first(first(p), x!1) = #(first(p)) o x!1 & add_first(first(p), y!1) = #(first(p)) o y!1" )
(("1"
(flatten)
(("1"
(replace -1 -3)
(("1"
(replace -2 -4)
(("1"
(assert )
(("1"
(replace
-1
-3
rl)
(("1"
(replace
-2
-4
rl)
(("1"
(expand
singleton)
(("1"
(replace
-4
-3
rl)
(("1"
(hide-all-but
(-3
1))
(("1"
(lemma
first_equal[posnat])
(("1"
(inst
-1
x!1
y!1
"first(p)"
"first(p)" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(split)
(("1"
(expand add_first 1)
(("1"
(expand insert?)
(("1"
(hide-all-but 1)
(("1"
(expand
finseq_appl)
(("1"
(expand o)
(("1"
(split)
(("1"
(grind)
nil
nil )
("2"
(case
"#(first(p))`length = 1" )
(("1"
(replace
-1)
(("1"
(assert )
(("1"
(decompose-equality)
(("1"
(lift-if)
(("1"
(lift-if)
(("1"
(assert )
(("1"
(grind)
nil
nil ))
nil ))
nil ))
nil )
("2"
(skosimp)
(("2"
(grind)
nil
nil ))
nil )
("3"
(skeep)
(("3"
(grind)
nil
nil ))
nil )
("4"
(skeep)
(("4"
(grind)
nil
nil ))
nil )
("5"
(skeep)
(("5"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
2)
(("2"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but 1)
(("2"
(case
"#(first(p))`length = 1" )
(("1"
(expand *
add_first
insert?)
(("1"
(expand
finseq_appl)
(("1"
(expand o)
(("1"
(split)
(("1"
(assert )
nil
nil )
("2"
(decompose-equality
1)
(("1"
(lift-if)
(("1"
(lift-if)
(("1"
(replace
-1)
(("1"
(assert )
(("1"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(skosimp)
(("2"
(grind)
nil
nil ))
nil )
("3"
(skeep)
(("3"
(grind)
nil
nil ))
nil )
("4"
(skeep)
(("4"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide 2)
(("2"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (expand member)
(("2" (hide -1 -2)
(("2" (expand Pos_var (-1 1))
(("2" (expand extend)
(("2" (prop)
(("1" (lemma pos_subterm)
(("1"
(inst -1 "#(first(p))" y!1 s)
(("1"
(lemma pos_o_term)
(("1"
(inst -1 "#(first(p))" y!1 s)
(("1" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil )
("2" (lemma pos_o_term)
(("2"
(inst -1 "#(first(p))" y!1 s)
(("2"
(assert )
(("2"
(expand positionsOF (-5 1))
(("2"
(lift-if)
(("2"
(prop)
(("1"
(expand only_empty_seq -2)
(("1"
(rewrite empty_0)
nil
nil ))
nil )
("2"
(hide -3)
(("2"
(expand only_empty_seq)
(("2"
(rewrite empty_0)
nil
nil ))
nil ))
nil )
("3"
(expand *
union
only_empty_seq
IUnion
catenate
member
finseq_appl)
(("3"
(prop)
(("1"
(rewrite empty_0)
nil
nil )
("2"
(skosimp)
(("2"
(skosimp)
(("2"
(inst
5
i!1
empty_seq)
(("2"
(split)
(("1"
(hide-all-but 1)
(("1"
(expand
positionsOF)
(("1"
(lift-if)
(("1"
(prop)
(("1"
(hide -1)
(("1"
(expand
only_empty_seq)
(("1"
(propax)
nil
nil ))
nil ))
nil )
("2"
(hide
-1
2)
(("2"
(expand
only_empty_seq)
(("2"
(propax)
nil
nil ))
nil ))
nil )
("3"
(expand *
union
only_empty_seq
IUnion
catenate
member
finseq_appl)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(lemma
first_add[posnat])
(("2"
(inst
-1
x!2
i!1)
(("2"
(replace
-3
1)
(("2"
(replace
-1
1)
(("2"
(hide-all-but
1)
(("2"
(lemma
add_first_empty_seq[posnat])
(("2"
(inst
-1
i!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 ))
nil ))
nil )
("2" (hide -2 -3 -7 2 4)
(("2" (expand Pos_var (-1 1))
(("2" (expand * extend member)
(("2" (prop)
(("1" (lemma pos_subterm)
(("1" (inst -1 "#(first(p))" x!1 s)
(("1" (assert ) nil nil )) nil ))
nil )
("2" (lemma pos_o_term)
(("2" (inst -1 "#(first(p))" x!1 s)
(("2" (assert )
(("2"
(hide 2)
(("2"
(expand positionsOF (-4 1))
(("2"
(lift-if)
(("2"
(prop)
(("1"
(hide-all-but (-2 2))
(("1"
(expand only_empty_seq)
(("1"
(rewrite empty_0)
nil
nil ))
nil ))
nil )
("2"
(hide-all-but (-2 4))
(("2"
(expand only_empty_seq)
(("2"
(rewrite empty_0)
nil
nil ))
nil ))
nil )
("3"
(expand *
union
IUnion
catenate
finseq_appl
only_empty_seq
member)
(("3"
(prop)
(("1"
(rewrite empty_0)
nil
nil )
("2"
(skosimp)
(("2"
(skosimp)
(("2"
(inst 5 i!1 empty_seq)
(("2"
(split)
(("1"
(hide-all-but 1)
(("1"
(expand
positionsOF)
(("1"
(lift-if)
(("1"
(prop)
(("1"
(hide-all-but
1)
(("1"
(grind)
nil
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(grind)
nil
nil ))
nil )
("3"
(expand *
union
IUnion
catenate
finseq_appl
only_empty_seq
member)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(lemma
first_add[posnat])
(("2"
(inst -1 x!2 i!1)
(("2"
(replace -3 1)
(("2"
(replace
-1
1)
(("2"
(lemma
add_first_empty_seq[posnat])
(("2"
(inst
-1
i!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 ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (case "card(Pos_var(subtermOF(s, #(first(p))), x)) = 0" )
(("1" (rewrite card_empty?)
(("1" (expand empty?)
(("1" (inst -1 "rest(p)" )
(("1" (expand member)
(("1" (hide -4 2 4)
(("1" (expand * Pos_var extend)
(("1" (prop)
(("1" (lemma pos_subterm)
(("1" (inst -1 "#(first(p))" "rest(p)" s)
(("1" (prop)
(("1" (lemma seq_first_rest_1[posnat])
(("1"
(inst -1 p)
(("1" (assert ) nil nil ))
nil ))
nil )
("2" (lemma seq_first_rest_1[posnat])
(("2"
(inst -1 p)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (lemma pos_subterm_ax)
(("2" (inst -1 "#(first(p))" "rest(p)" s)
(("2" (assert )
(("2" (lemma seq_first_rest_1[posnat])
(("2"
(inst -1 p)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (assert ) nil nil ))
nil ))
nil ))
nil )
((first const-decl "T" seq_extras "structures/" )
(not_empty_seq type-eq-decl nil seq_extras "structures/" )
(/= const-decl "boolean" notequal nil )
(finseq type-eq-decl nil finite_sequences nil )
(|#| const-decl "finite_sequence[T]" set2seq "structures/" )
(finite_sequence type-eq-decl nil finite_sequences nil )
(subtermOF def-decl "term" subterm nil )
(positions? type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(Pos_var const-decl "positions" subterm nil )
(positions type-eq-decl nil positions nil )
(V const-decl "set[term]" variables_term nil )
(term type-decl nil term_adt nil )
(card const-decl "{n: nat | n = Card(S)}" finite_sets nil )
(Card const-decl "nat" finite_sets nil )
(= const-decl "[T, T -> boolean]" equalities 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 )
(position type-eq-decl nil positions nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers 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 )
(below type-eq-decl nil nat_types nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(extend const-decl "R" extend nil )
(card_one formula-decl nil finite_sets nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(first_equal formula-decl nil seq_extras "structures/" )
(y!1 skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(< const-decl "bool" reals nil )
(IFF const-decl "[bool, bool -> bool]" booleans nil )
(p skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(- const-decl "[numfield, numfield -> numfield]" number_fields nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil )
(x!1 skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(int_minus_int_is_int application-judgement "int" integers nil )
(nnint_plus_nnint_is_nnint application-judgement "nonneg_int"
integers 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 )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(insert? const-decl "finseq" seq_extras "structures/" )
(add_first const-decl "finseq" seq_extras "structures/" )
(nonempty_singleton_finite application-judgement
"non_empty_finite_set[position]" orthogonality nil )
(IF const-decl "[boolean, T, T -> T]" if_def nil )
(FALSE const-decl "bool" booleans nil )
(singleton? const-decl "bool" sets nil )
(singleton const-decl "(singleton?)" sets nil )
(catenate const-decl "positions" positions nil )
(IUnion const-decl "set[T]" indexed_sets nil )
(union const-decl "set" sets nil )
(empty_seq const-decl "finseq" finite_sequences nil )
(<= const-decl "bool" reals nil )
(app? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(f adt-accessor-decl "[(app?) -> symbol]" term_adt nil )
(args adt-accessor-decl
"[d: (app?) -> {args: finite_sequence[term] | args`length = arity(f(d))}]"
term_adt nil )
(upto? nonempty-type-eq-decl nil IUnion_extra nil )
(first_add formula-decl nil seq_extras "structures/" )
(add_first_empty_seq formula-decl nil seq_extras "structures/" )
(only_empty_seq const-decl "positions" positions nil )
(empty_0 formula-decl nil seq_extras "structures/" )
(pos_subterm formula-decl nil subterm nil )
(pos_o_term formula-decl nil subterm nil )
(O const-decl "finseq" finite_sequences nil )
(member const-decl "bool" sets nil )
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(card_2_has_2 formula-decl nil finite_sets nil )
(card_empty? formula-decl nil finite_sets nil )
(rest const-decl "finseq" seq_extras "structures/" )
(seq_first_rest_1 formula-decl nil seq_extras "structures/" )
(pos_subterm_ax formula-decl nil subterm nil )
(empty? const-decl "bool" sets nil ))
shostak))
(SigmaP_equivalence_TCC1 0
(SigmaP_equivalence_TCC1-1 nil 3481280713
("" (skosimp)
(("" (hide 1)
(("" (typepred x!1)
(("" (expand * V ext ) (("" (assert ) nil nil )) nil )) nil ))
nil ))
nil )
((ext def-decl "term" substitution nil )
(boolean nonempty-type-decl nil booleans nil )
(bool nonempty-type-eq-decl nil booleans nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality 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 )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(term type-decl nil term_adt nil ) (set type-eq-decl nil sets nil )
(V const-decl "set[term]" variables_term nil ))
nil ))
(SigmaP_equivalence_TCC2 0
(SigmaP_equivalence_TCC2-1 nil 3481280713
("" (skosimp)
(("" (lemma SigmaP_Subs)
(("" (inst -1 p2!1 sigma!1 t!1 x!1)
(("" (assert )
(("" (typepred x!1)
(("" (expand * V ext ) (("" (assert ) nil nil )) nil )) nil ))
nil ))
nil ))
nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(SigmaP_Subs formula-decl nil substitution nil )
(ext def-decl "term" substitution nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(Sub type-eq-decl nil substitution nil )
(Sub? const-decl "bool" substitution nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(SigmaP_equivalence 0
(SigmaP_equivalence-1 nil 3481280714
("" (induct s)
(("1" (skeep)
(("1" (skeep)
(("1" (expand SigmaP)
(("1" (case "x = vars(vars1_var)" )
(("1" (name-replace "z" "vars(vars1_var)" )
(("1" (hide 2)
(("1" (replace -1 1)
(("1" (expand member)
(("1" (expand Vars)
(("1" (inst 1 empty_seq)
(("1" (grind) nil nil )
("2" (hide -) (("2" (grind) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (name-replace "z" "vars(vars1_var)" )
(("2" (expand ext 3 2)
(("2" (assert )
(("2" (expand ext 3) (("2" (propax) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (skeep)
(("2" (skeep)
(("2" (expand ext 2)
(("2" (assert )
(("2" (lift-if)
(("2" (case "length(app2_var) = 0" )
(("1" (assert ) nil nil )
("2" (split)
(("1" (propax) nil nil )
("2" (assert )
(("2" (decompose-equality)
(("1" (decompose-equality)
(("1" (decompose-equality)
(("1" (inst -1 "x!1" )
(("1" (inst -1 "p2" "sigma" "t" "x" )
(("1"
(assert )
(("1"
(expand finseq_appl)
(("1"
(prop)
(("1"
(hide-all-but (-1 3))
(("1"
(expand * member Vars)
(("1"
(skosimp*)
(("1"
(inst
1
" add_first(x!1 + 1, p!1)" )
(("1"
(expand subtermOF 1)
(("1"
(lift-if)
(("1"
(prop)
(("1"
(hide -2 1)
(("1"
(expand
add_first)
(("1"
(expand
insert?)
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil )
("2"
(expand
finseq_appl)
(("2"
(rewrite
rest_add_first)
(("2"
(rewrite
first_add)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(expand positionsOF)
(("2"
(expand union)
(("2"
(flatten)
(("2"
(hide 1)
(("2"
(expand member)
(("2"
(expand IUnion)
(("2"
(inst
1
"x!1 + 1" )
(("2"
(expand
finseq_appl)
(("2"
(expand
catenate)
(("2"
(inst
1
p!1)
(("2"
(typepred
p!1)
(("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 ))
nil ))
nil ))
nil )
("2" (skeep)
(("2" (lemma SigmaP_Subs)
(("2"
(inst -1 p2 sigma t x)
(("2"
(assert )
(("2"
(typepred x)
(("2"
(expand V)
(("2"
(expand ext -3)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (skeep)
(("3" (hide-all-but (-2 1))
(("3"
(typepred x)
(("3"
(expand V)
(("3"
(expand ext -2)
(("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (skeep)
(("2" (lemma SigmaP_Subs)
(("2" (inst -1 p2 sigma t x)
(("2"
(assert )
(("2"
(hide-all-but (-2 1))
(("2"
(typepred x)
(("2"
(expand V)
(("2"
(expand ext -2)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (skeep)
(("3" (lemma SigmaP_Subs)
(("3" (inst -1 p2 sigma t x)
(("3"
(assert )
(("3"
(hide-all-but (-3 1))
(("3"
(typepred x)
(("3"
(expand V)
(("3"
(expand ext -2)
(("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (skeep)
(("2" (lemma SigmaP_Subs)
(("2" (inst -1 p2 sigma t x)
(("2" (assert )
(("2"
(hide-all-but (-2 1))
(("2"
(typepred x)
(("2"
(expand V)
(("2"
(expand ext -2)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (skeep)
(("3" (hide-all-but (-2 1))
(("3" (typepred x)
(("3" (expand V)
(("3"
(expand ext -2)
(("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (hide 2)
(("3" (skeep)
(("3" (lemma SigmaP_Subs)
(("3" (inst -1 p2 sigma t x)
(("3" (assert )
(("3" (hide-all-but (-1 1))
(("3" (typepred x)
(("3" (expand V)
(("3" (expand ext -2) (("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4" (hide 2)
(("4" (skeep)
(("4" (hide 1)
(("4" (typepred x)
(("4" (expand V)
(("4" (expand ext -2) (("4" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((< const-decl "bool" reals nil )
(app1_var skolem-const-decl "symbol" orthogonality nil )
(app2_var skolem-const-decl
"{args: finite_sequence[term[variable, symbol, arity]] |
args`length = arity(app1_var)}" orthogonality nil)
(sigma skolem-const-decl "Sub[variable, symbol, arity]"
orthogonality nil )
(x skolem-const-decl "(V)" orthogonality nil )
(p2 skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(t skolem-const-decl "term[variable, symbol, arity]" orthogonality
nil )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(app adt-constructor-decl
"[[f: symbol, {args: finite_sequence[term] | args`length = arity(f)}] ->
(app?)]" term_adt nil)
(term_app_extensionality formula-decl nil term_adt nil )
(app? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(upto? nonempty-type-eq-decl nil IUnion_extra nil )
(<= const-decl "bool" reals nil )
(catenate const-decl "positions" positions nil )
(IUnion const-decl "set[T]" indexed_sets nil )
(union const-decl "set" sets nil )
(insert? const-decl "finseq" seq_extras "structures/" )
(rest_add_first formula-decl nil seq_extras "structures/" )
(int_minus_int_is_int application-judgement "int" integers nil )
(first_add formula-decl nil seq_extras "structures/" )
(p!1 skolem-const-decl
"positions?[variable, symbol, arity](app2_var`seq(x!1))"
orthogonality nil )
(x!1 skolem-const-decl "below[app2_var`length]" orthogonality nil )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(add_first const-decl "finseq" seq_extras "structures/" )
(nnint_plus_posint_is_posint application-judgement "posint"
integers nil )
(SigmaP_Subs formula-decl nil substitution nil )
(finite_sequence type-eq-decl nil finite_sequences nil )
(only_empty_seq const-decl "positions" positions nil )
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil )
(subtermOF def-decl "term" subterm nil )
(empty_seq const-decl "finseq" finite_sequences nil )
(finseq type-eq-decl nil finite_sequences nil )
(z skolem-const-decl "(vars?)" orthogonality nil )
(vars adt-constructor-decl "[variable -> (vars?)]" term_adt nil )
(vars? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(term_induction formula-decl nil term_adt nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(positions? type-eq-decl nil positions nil )
(SigmaP const-decl "term" substitution nil )
(term type-decl nil term_adt nil )
(below type-eq-decl nil nat_types nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(posnat nonempty-type-eq-decl nil integers nil )
(position type-eq-decl nil positions nil )
(set type-eq-decl nil sets nil )
(V const-decl "set[term]" variables_term nil )
(Sub? const-decl "bool" substitution nil )
(Sub type-eq-decl nil substitution nil )
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(member const-decl "bool" sets nil )
(Vars const-decl "set[(V)]" subterm nil )
(positions type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(ext def-decl "term" substitution nil ))
shostak))
(SigmaP_vs_replaceTerm_linearR_TCC1 0
(SigmaP_vs_replaceTerm_linearR_TCC1-1 nil 3452963667
("" (skosimp) (("" (expand ext -3) (("" (assert ) nil nil )) nil ))
nil )
((ext def-decl "term" substitution nil )) nil ))
(SigmaP_vs_replaceTerm_linearR_TCC2 0
(SigmaP_vs_replaceTerm_linearR_TCC2-1 nil 3452963667
("" (skosimp)
(("" (lemma SigmaP_Subs)
(("" (inst -1 p2!1 sigma!1 t!1 x!1)
(("" (expand ext -4) (("" (assert ) nil nil )) nil )) nil ))
nil ))
nil )
((arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(>= const-decl "bool" reals nil )
(bool nonempty-type-eq-decl nil booleans 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 )
(boolean nonempty-type-decl nil booleans nil )
(number nonempty-type-decl nil numbers nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(SigmaP_Subs formula-decl nil substitution nil )
(ext def-decl "term" substitution nil )
(Sub type-eq-decl nil substitution nil )
(Sub? const-decl "bool" substitution nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil )
(position type-eq-decl nil positions nil )
(posnat nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(below type-eq-decl nil nat_types nil ))
nil ))
(SigmaP_vs_replaceTerm_linearR_TCC3 0
(SigmaP_vs_replaceTerm_linearR_TCC3-1 nil 3452963667
("" (skosimp*)
(("" (assert )
(("" (lemma "subterm_ext_commute" )
(("" (inst -1 "p1!1" "s!1" "sigma!1" )
(("" (assert )
(("" (replace -3 -1 rl)
(("" (replace -1 -4 rl)
(("" (rewrite pos_o_term)
(("" (lemma positions_of_ext)
(("" (inst -1 sigma!1 s!1)
(("" (decompose-equality -1)
(("" (inst -1 p1!1)
(("" (iff)
(("" (flatten)
((""
(hide -1)
((""
(expand * union member)
((""
(inst 1 p1!1 empty_seq)
((""
(rewrite seq_o_empty)
((""
(assert )
((""
(hide-all-but 1)
((""
(expand *
positionsOF
only_empty_seq
empty_seq)
((""
(lift-if)
((""
(assert )
((""
(prop)
((""
(expand *
union
member)
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 ))
nil )
((below type-eq-decl nil nat_types nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(posnat nonempty-type-eq-decl nil integers nil )
(position type-eq-decl nil positions nil )
(term type-decl nil term_adt nil ) (set type-eq-decl nil sets nil )
(V const-decl "set[term]" variables_term nil )
(Sub? const-decl "bool" substitution nil )
(Sub type-eq-decl nil substitution nil )
(pos_o_term formula-decl nil subterm nil )
(ext def-decl "term" substitution nil )
(member const-decl "bool" sets nil )
(seq_o_empty formula-decl nil seq_extras "structures/" )
(only_empty_seq const-decl "positions" positions nil )
(empty_seq const-decl "finseq" finite_sequences nil )
(O const-decl "finseq" finite_sequences nil )
(finseq type-eq-decl nil finite_sequences nil )
(subtermOF def-decl "term" subterm nil )
(positions? type-eq-decl nil positions nil )
(vars? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(union const-decl "set" sets nil )
(positionsOF def-decl "positions" positions nil )
(positions type-eq-decl nil positions nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(positions_of_ext formula-decl nil substitution nil )
(subterm_ext_commute formula-decl nil substitution nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil ))
nil ))
(SigmaP_vs_replaceTerm_linearR 0
(SigmaP_vs_replaceTerm_linearR-1 nil 3459620652
("" (lemma finite_sets[position].card_def)
(("" (lemma finite_sets[position].card_one)
(("" (expand singleton)
(("" (induct s)
(("1" (skeep)
(("1" (skeep)
(("1" (case "vars(vars1_var) = x" )
(("1" (name-replace "z" "vars(vars1_var)" )
(("1" (replace -1)
(("1" (expand ext 1 1)
(("1" (lift-if)
(("1" (assert )
(("1" (expand SigmaP)
(("1" (expand positionsOF -3)
(("1"
(expand only_empty_seq)
(("1"
(replace -3 1)
(("1"
(rewrite empty_o_seq)
(("1"
(expand ext 1)
(("1" (propax) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (name-replace "z" "vars(vars1_var)" )
(("2" (hide 2)
(("2" (expand positionsOF -2)
(("2" (assert )
(("2" (expand only_empty_seq)
(("2" (replace -2 -4)
(("2" (expand subtermOF -4)
(("2"
(rewrite empty_0)
(("2" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (skeep)
(("2" (skeep)
(("2" (name-replace "sym" "app1_var" )
(("2" (expand ext 1 1)
(("2" (lift-if)
(("2" (assert )
(("2" (case "length(app2_var) = 0" )
(("1" (hide-all-but (-1 -3 -4 -6 1))
(("1" (expand positionsOF)
(("1" (assert )
(("1"
(expand only_empty_seq)
(("1"
(replace -3 -4)
(("1"
(expand subtermOF)
(("1"
(rewrite empty_0)
(("1" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2" (assert )
(("2" (expand finseq_appl 2)
(("2" (expand replaceTerm 2)
(("2"
(lift-if)
(("2"
(case "length(p1 o p2) = 0" )
(("1"
(hide 2)
(("1"
(rewrite empty_0)
(("1"
(lemma seq_empty[posnat])
(("1"
(inst -1 p1 p2)
(("1"
(assert )
(("1"
(flatten)
(("1"
(hide-all-but
(-1 -5 -6 -8))
(("1"
(rewrite empty_0)
(("1"
(replace -1 -4)
(("1"
(hide -1 -3)
(("1"
(expand
subtermOF)
(("1"
(assert )
(("1"
(lift-if)
(("1"
(assert )
(("1"
(rewrite
empty_0)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(assert )
(("2"
(decompose-equality 3)
(("1"
(hide-all-but 1)
(("1" (grind) nil nil ))
nil )
("2"
(expand finseq_appl)
(("2"
(expand ext 1 2)
(("2"
(expand finseq_appl)
(("2"
(expand ext 1 3)
(("2"
(expand finseq_appl)
(("2"
(expand replace 1)
(("2"
(decompose-equality
1)
(("1"
(lift-if)
(("1"
(expand
finseq_appl)
(("1"
(case
"x!1 = first(p1 o p2) - 1" )
(("1"
(assert )
(("1"
(inst
-2
x!1)
(("1"
(inst
-2
"rest(p1)"
p2
sigma
t
x)
(("1"
(assert )
(("1"
(prop)
(("1"
(replace
-2
1
rl)
(("1"
(assert )
(("1"
(rewrite
rest_compo)
(("1"
(hide-all-but
(-3
-4
-6
1))
(("1"
(prop)
(("1"
(rewrite
empty_0)
(("1"
(expand
subtermOF)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(lemma
rest_of_positions)
(("2"
(inst
-1
p1
"app(sym, app2_var)" )
(("2"
(assert )
(("2"
(prop)
(("1"
(replace
-2
1)
(("1"
(expand
finseq_appl)
(("1"
(rewrite
first_compo)
(("1"
(hide-all-but
(-3
-4
-6
1))
(("1"
(prop)
(("1"
(rewrite
empty_0)
(("1"
(expand
subtermOF)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(-1
-3
-4
-6))
(("2"
(expand
subtermOF)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(hide-all-but
(-1
-2
-3
-5
1))
(("3"
(replaces
-4)
(("3"
(expand
subtermOF
1
1)
(("3"
(lift-if)
(("3"
(prop)
(("1"
(hide
1)
(("1"
(expand
subtermOF)
(("1"
(assert )
nil
nil ))
nil ))
nil )
("2"
(expand
finseq_appl)
(("2"
(replace
-1
2)
(("2"
(rewrite
first_compo)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4"
(hide
2
3
4)
(("4"
(case
"length(p1) /= 0" )
(("1"
(prop)
(("1"
(lemma
Var_occurs_only_once_also_in_subterms)
(("1"
(inst
-1
p1
"app(sym, app2_var)"
x)
(("1"
(assert )
(("1"
(copy
-9)
(("1"
(inst
-1
"Pos_var(app(sym, app2_var), x)" )
(("1"
(inst
-10
"Pos_var(app2_var`seq(x!1), x)" )
(("1"
(replace
-1
-8
rl)
(("1"
(replace
-10
2
rl)
(("1"
(hide
-1
-9
-10)
(("1"
(assert )
(("1"
(rewrite
first_compo)
(("1"
(expand
subtermOF
-1)
(("1"
(assert )
(("1"
(lift-if
-1)
(("1"
(assert )
(("1"
(case
"length( #(first(p1))) /= 0" )
(("1"
(assert )
(("1"
(expand *
finseq_appl)
(("1"
(expand
first
-2
1)
(("1"
(expand *
finseq_appl)
(("1"
(assert )
(("1"
(case
" length( #(first(p1))) = 1" )
(("1"
(expand
subtermOF
-3)
(("1"
(lift-if)
(("1"
(expand
rest
-3
1)
(("1"
(expand *
^
min
empty_seq)
(("1"
(assert )
(("1"
(expand
"#"
-3)
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(prop)
(("2"
(hide-all-but
1)
(("2"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
(1
2))
(("2"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(prop)
(("2"
(hide-all-but
(-1
-3
-6))
(("2"
(expand
subtermOF)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
-1
-7)
(("2"
(assert )
(("2"
(case
"member(x, Vars(app2_var`seq(x!1)))" )
(("1"
(expand
member)
(("1"
(inst
-7
"Pos_var(app(sym, app2_var), x)" )
(("1"
(replace
-7
-6
rl)
(("1"
(hide
-4
-7
2
3
4)
(("1"
(rewrite
card_one)
(("1"
(skosimp)
(("1"
(case
"length(p1) = 0" )
(("1"
(expand
subtermOF)
(("1"
(assert )
nil
nil ))
nil )
("2"
(expand
singleton)
(("2"
(decompose-equality
-5)
(("2"
(copy
-1)
(("2"
(case
"EXISTS p: positionsOF(app(sym, app2_var))(p) & p /= p1 & subtermOF(app(sym, app2_var), p) = x" )
(("1"
(skeep
-1)
(("1"
(inst
-3
p1)
(("1"
(inst
-4
p)
(("1"
(case
"Pos_var(app(sym, app2_var), x)(p1) & Pos_var(app(sym, app2_var), x)(p)" )
(("1"
(flatten)
(("1"
(assert )
nil
nil ))
nil )
("2"
(split)
(("1"
(expand
Pos_var
1)
(("1"
(expand
extend)
(("1"
(propax)
nil
nil ))
nil ))
nil )
("2"
(expand
Pos_var
1)
(("2"
(expand
extend)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
-1
-2)
(("2"
(expand
Vars
-1)
(("2"
(skosimp)
(("2"
(expand
subtermOF
-4)
(("2"
(assert )
(("2"
(expand
finseq_appl)
(("2"
(inst
1
"add_first(x!1 + 1, p!1)" )
(("2"
(split)
(("1"
(expand
positionsOF
1)
(("1"
(expand *
union
IUnion
only_empty_seq
catenate
finseq_appl
member)
(("1"
(prop)
(("1"
(inst
2
"1 + x!1"
p!1)
(("1"
(hide
1)
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(prop)
(("2"
(rewrite
first_compo)
(("2"
(lemma
seq_first_rest[posnat])
(("2"
(inst
-1
p1)
(("2"
(assert )
(("2"
(replace
-1
-2)
(("2"
(hide
-1)
(("2"
(lemma
first_equal[posnat])
(("2"
(inst
-1
p!1
"rest(p1)"
"1 + x!1"
"first(p1)" )
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(expand
subtermOF
1)
(("3"
(lift-if)
(("3"
(prop)
(("1"
(hide-all-but
-1)
(("1"
(expand *
add_first
insert?)
(("1"
(assert )
nil
nil ))
nil ))
nil )
("2"
(expand
finseq_appl)
(("2"
(lemma
rest_add_first[posnat])
(("2"
(inst
-1
p!1
"1 + x!1" )
(("2"
(replaces
-1)
(("2"
(lemma
first_add[posnat])
(("2"
(inst
-1
p!1
"1 + x!1" )
(("2"
(replaces
-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 ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(expand
member)
(("2"
(hide
-2
-4
-5
-6
2
4
5)
(("2"
(lemma
SigmaP_equivalence)
(("2"
(inst
-1
p2
"app2_var`seq(x!1)"
sigma
t
x)
(("2"
(assert )
(("2"
(expand
member)
(("2"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(skeep)
(("2"
(hide-all-but
(-4
-5
-6
2
3))
(("2"
(lemma
ext_preserv_pos)
(("2"
(inst
-1
p1
"app(sym, app2_var)"
sigma)
(("2"
(assert )
(("2"
(replaces
-4)
(("2"
(lemma
subterm_ext_commute)
(("2"
(inst
-1
p1
"app(sym, app2_var)"
sigma)
(("2"
(assert )
(("2"
(replace
-1
-4
rl)
(("2"
(lemma
rest_of_positions)
(("2"
(inst
-1
"p1 o p2"
"ext(sigma)(app(sym, app2_var))" )
(("2"
(prop)
(("1"
(hide-all-but
(-1
1))
(("1"
(expand
finseq_appl)
(("1"
(case
"args(ext(sigma)(app(sym, app2_var)))`seq(first(p1 o p2) - 1) = ext(sigma)(app2_var`seq(first(o(p1, p2)) - 1))" )
(("1"
(replace
-1)
(("1"
(propax)
nil
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(grind)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(lemma
pos_o_term)
(("2"
(inst
-1
p1
p2
"ext(sigma)(app(sym, app2_var))" )
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(skeep)
(("3"
(hide-all-but
(-3 -4 -6 2))
(("3"
(case
"length(p1) = 0" )
(("1"
(expand
subtermOF
-4)
(("1"
(assert )
nil
nil ))
nil )
("2"
(rewrite
first_compo)
(("2"
(expand *
positionsOF
union
IUnion
member
only_empty_seq)
(("2"
(rewrite
empty_0)
(("2"
(assert )
(("2"
(skosimp)
(("2"
(expand
catenate)
(("2"
(skosimp)
(("2"
(expand
add_first)
(("2"
(expand
insert?)
(("2"
(decompose-equality
-3)
(("2"
(decompose-equality
-2)
(("2"
(inst
-1
0)
(("1"
(expand
first
2)
(("1"
(expand
finseq_appl)
(("1"
(expand
member)
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil )
("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4"
(skeep)
(("4"
(rewrite
SigmaP_Subs)
(("4"
(expand
ext
-4)
(("4"
(propax)
nil
nil ))
nil ))
nil ))
nil )
("5"
(skeep)
(("5"
(expand ext -4)
(("5"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(skeep)
(("3"
(expand ext -4)
(("3"
(rewrite SigmaP_Subs)
nil
nil ))
nil ))
nil )
("4"
(skeep)
(("4"
(expand ext -4)
(("4" (propax) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3" (skeep)
(("3" (lemma ext_preserv_pos)
(("3" (inst -1 p1 s sigma)
(("3" (assert )
(("3" (hide 2)
(("3" (replace -5 -4)
(("3" (lemma subterm_ext_commute)
(("3" (inst -1 p1 s sigma)
(("3" (assert )
(("3" (replace -1 -5 rl)
(("3"
(lemma pos_o_term)
(("3"
(inst -1 p1 p2 "ext(sigma)(s)" )
(("3" (assert ) nil nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("4" (skeep)
(("4" (expand ext -3)
(("4" (assert ) (("4" (rewrite SigmaP_Subs) nil nil ))
nil ))
nil ))
nil )
("5" (skeep)
(("5" (expand ext -3) (("5" (assert ) nil nil )) nil )) nil )
("6" (skeep)
(("6" (hide-all-but 1)
(("6" (lemma Pos_var_is_finite)
(("6" (inst -1 s x) (("6" (assert ) nil nil )) nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
((card_one formula-decl nil finite_sets nil )
(Pos_var const-decl "positions" subterm nil )
(is_finite const-decl "bool" finite_sets nil )
(vars? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(ext def-decl "term" substitution nil )
(subtermOF def-decl "term" subterm nil )
(positions? type-eq-decl nil positions nil )
(positionsOF def-decl "positions" positions nil )
(positions type-eq-decl nil positions nil )
(= const-decl "[T, T -> boolean]" equalities nil )
(AND const-decl "[bool, bool -> bool]" booleans nil )
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil )
(Sub type-eq-decl nil substitution nil )
(Sub? const-decl "bool" substitution nil )
(V const-decl "set[term]" variables_term nil )
(set type-eq-decl nil sets nil ) (term type-decl nil term_adt nil )
(Card const-decl "nat" finite_sets nil )
(finite_set type-eq-decl nil finite_sets nil )
(SigmaP const-decl "term" substitution nil )
(O const-decl "finseq" finite_sequences nil )
(finseq type-eq-decl nil finite_sequences nil )
(replaceTerm def-decl "term" replacement nil )
(term_induction formula-decl nil term_adt nil )
(empty_0 formula-decl nil seq_extras "structures/" )
(empty_seq const-decl "finseq" finite_sequences nil )
(empty_o_seq formula-decl nil seq_extras "structures/" )
(only_empty_seq const-decl "positions" positions nil )
(vars adt-constructor-decl "[variable -> (vars?)]" term_adt nil )
(seq_empty formula-decl nil seq_extras "structures/" )
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(< const-decl "bool" reals nil )
(app1_var skolem-const-decl "symbol" orthogonality nil )
(app2_var skolem-const-decl
"{args: finite_sequence[term[variable, symbol, arity]] |
args`length = arity(app1_var)}" orthogonality nil)
(sigma skolem-const-decl "Sub[variable, symbol, arity]"
orthogonality nil )
(x skolem-const-decl "(V)" orthogonality nil )
(p2 skolem-const-decl "position[variable, symbol, arity]"
orthogonality nil )
(t skolem-const-decl "term[variable, symbol, arity]" orthogonality
nil )
(rest const-decl "finseq" seq_extras "structures/" )
(first const-decl "T" seq_extras "structures/" )
(not_empty_seq type-eq-decl nil seq_extras "structures/" )
(/= const-decl "boolean" notequal nil )
(- const-decl "[numfield, numfield -> numfield]" number_fields nil )
(numfield nonempty-type-eq-decl nil number_fields nil )
(args adt-accessor-decl
"[d: (app?) -> {args: finite_sequence[term] | args`length = arity(f(d))}]"
term_adt nil )
(replace const-decl "finseq" seq_extras "structures/" )
(f adt-accessor-decl "[(app?) -> symbol]" term_adt nil )
(app adt-constructor-decl
"[[f: symbol, {args: finite_sequence[term] | args`length = arity(f)}] ->
(app?)]" term_adt nil)
(term_app_extensionality formula-decl nil term_adt nil )
(app? adt-recognizer-decl "[term -> boolean]" term_adt nil )
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil )
(SigmaP_Subs formula-decl nil substitution nil )
(IFF const-decl "[bool, bool -> bool]" booleans nil )
(ext_preserv_pos formula-decl nil substitution nil )
(subterm_ext_commute formula-decl nil substitution nil )
(nnint_plus_nnint_is_nnint application-judgement "nonneg_int"
integers nil )
(pos_o_term formula-decl nil subterm nil )
(|#| const-decl "finite_sequence[T]" set2seq "structures/" )
(min const-decl "{p: real | p <= m AND p <= n}" real_defs nil )
(^ const-decl "finseq" finite_sequences nil )
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil )
(Var_occurs_only_once_also_in_subterms formula-decl nil
orthogonality nil )
(rest_of_positions formula-decl nil positions nil )
(first_compo formula-decl nil seq_extras "structures/" )
(rest_compo formula-decl nil seq_extras "structures/" )
(SigmaP_equivalence formula-decl nil orthogonality nil )
(nonempty_singleton_finite application-judgement
"non_empty_finite_set[position]" orthogonality nil )
(extend const-decl "R" extend nil )
(IUnion const-decl "set[T]" indexed_sets nil )
(catenate const-decl "positions" positions nil )
(union const-decl "set" sets nil )
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil )
(<= const-decl "bool" reals nil )
(upto? nonempty-type-eq-decl nil IUnion_extra nil )
(first_equal formula-decl nil seq_extras "structures/" )
(seq_first_rest formula-decl nil seq_extras "structures/" )
(first_add formula-decl nil seq_extras "structures/" )
(rest_add_first formula-decl nil seq_extras "structures/" )
(insert? const-decl "finseq" seq_extras "structures/" )
(add_first const-decl "finseq" seq_extras "structures/" )
(+ const-decl "[numfield, numfield -> numfield]" number_fields nil )
(nnint_plus_posint_is_posint application-judgement "posint"
integers nil )
(Vars const-decl "set[(V)]" subterm nil )
(member const-decl "bool" sets nil )
(IF const-decl "[boolean, T, T -> T]" if_def nil )
(NOT const-decl "[bool -> bool]" booleans nil )
(p1 skolem-const-decl "position[variable, symbol, arity]"
orthogonality 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 )
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil )
(finite_sequence type-eq-decl nil finite_sequences nil )
(Pos_var_is_finite formula-decl nil subterm nil )
(singleton const-decl "(singleton?)" sets nil )
(card_def formula-decl nil finite_sets nil )
(nat nonempty-type-eq-decl nil naturalnumbers nil )
(below type-eq-decl nil nat_types nil )
(number nonempty-type-decl nil numbers nil )
(boolean nonempty-type-decl nil 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 )
(int nonempty-type-eq-decl nil integers nil )
(bool nonempty-type-eq-decl nil booleans nil )
(>= const-decl "bool" reals nil )
(nonneg_int nonempty-type-eq-decl nil integers nil )
(> const-decl "bool" reals nil )
(posnat nonempty-type-eq-decl nil integers nil )
(variable formal-nonempty-type-decl nil orthogonality nil )
(symbol formal-nonempty-type-decl nil orthogonality nil )
(arity formal-const-decl "[symbol -> nat]" orthogonality nil )
(position type-eq-decl nil positions nil ))
shostak))
(Orth_lemma_aux 0
(Orth_lemma_aux-1 nil 3448728252
("" (skeep)
(("" (assert )
(("" (flatten)
(("" (lemma "replace_distributivity" )
(("" (inst -1 p1 p2 t "ext(sg2)(ext(rho2)(rhs(e2p)))" )
(("" (assert )
(("" (lemma "pos_subterm" )
(("" (inst -1 p1 p2 t)
(("" (assert )
(("" (lemma "positions_of_ext" )
(("" (inst -1 "comp(sg1, rho1)" "lhs(e1p)" )
(("1" (decompose-equality -1)
(("1" (inst -1 "p2" )
(("1" (iff)
(("1"
(flatten)
(("1"
(hide -2)
(("1"
(expand * "union" "member" )
(("1"
(prop)
(("1"
(lemma "ntCP_lemma_aux1" )
(("1"
(inst
-1
"comp(sg1, rho1)"
"comp(sg2, rho2)"
"E"
"p2"
"e1p"
"e2p" )
(("1"
(expand Ambiguous?)
(("1"
(prop)
(("1"
(skosimp)
(("1"
(inst
2
"t1!1"
"t2!1" )
nil
nil ))
nil )
("2"
(lemma
"subterm_ext_commute" )
(("2"
(inst
-1
"p2"
"lhs(e1p)"
"comp(sg1, rho1)" )
(("2"
(assert )
(("2"
(hide-all-but
(-1
-3
-9
-11
-13
1))
(("2"
(rewrite ext_o)
(("2"
(rewrite
ext_o)
(("2"
(expand
o
(-1 1))
(("2"
(replaces
-3)
(("2"
(replace
-1
1
rl)
(("2"
(replace
-4
1
rl)
(("2"
(replace
-3
1
rl)
(("2"
(replace
-2
1)
(("2"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("3"
(replace -1)
(("3"
(replace -2)
(("3"
(expand lhs)
(("3"
(expand rhs)
(("3"
(decompose-equality
-1)
(("3"
(rewrite
seq_o_empty)
(("3"
(replace
-11)
(("3"
(hide
1
2)
(("3"
(inst
1
t1)
(("3"
(replace
-14
1)
(("3"
(replace
-16
1)
(("3"
(replace
-13
-15)
(("3"
(hide-all-but
(-15
1))
(("3"
(lemma
ext_o)
(("3"
(inst-cp
-1
sg1
rho1)
(("3"
(inst
-1
sg2
rho2)
(("3"
(expand
o)
(("3"
(decompose-equality
-1)
(("3"
(decompose-equality
-2)
(("3"
(inst-cp
-2
"e2p`2" )
(("3"
(inst
-2
"e2p`1" )
(("3"
(inst-cp
-1
"e2p`2" )
(("3"
(inst
-
"e2p`1" )
(("3"
(replace
-1
-5
rl)
(("3"
(replace
-3
-5
rl)
(("3"
(replace
-2
1
rl)
(("3"
(replace
-4
1
rl)
(("3"
(hide
-1
-2
-3
-4)
(("3"
(lemma
same_substitution)
(("3"
(inst
-1
"comp(sg1, rho1)"
"comp(sg2, rho2)"
"e2p`1" )
(("3"
(typepred
"e2p" )
(("3"
(expand
rewrite_rule?)
(("3"
(flatten)
(("3"
(expand
subset?)
(("3"
(lemma
same_term)
(("3"
(inst
-1
"comp(sg1, rho1)"
"comp(sg2, rho2)"
"e2p`2" )
(("3"
(expand
RC)
(("3"
(expand *
union
member)
(("3"
(flatten)
(("3"
(hide
2)
(("3"
(assert )
(("3"
(skeep)
(("3"
(inst
-2
x)
(("3"
(inst
-3
x)
(("3"
(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 ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but 1)
(("2"
(rewrite subs_o)
nil
nil ))
nil )
("3"
(hide-all-but 1)
(("3"
(rewrite subs_o)
nil
nil ))
nil ))
nil ))
nil )
("2"
(hide 1)
(("2"
(skolem -1 ("p1p" "p2p" ))
(("2"
(expand Linear?)
(("2"
(flatten)
(("2"
(expand Left_Linear?)
(("2"
(expand
Right_Linear?)
(("2"
(inst -12 e1p)
(("2"
(inst -13 e1p)
(("2"
(expand
linear?)
(("2"
(inst
-12
"subtermOF(lhs(e1p), p1p)" )
(("1"
(inst
-13
"subtermOF(lhs(e1p), p1p)" )
(("1"
(lemma
Orth_lemma_aux0)
(("1"
(inst
-1
"rhs(e1p)"
"subtermOF(lhs(e1p), p1p)" )
(("1"
(assert )
(("1"
(skolem
-1
pr)
(("1"
(flatten)
(("1"
(inst
1
"replaceTerm( t1, ext(SigmaP(comp(sg1, rho1), ext(sg2)(ext(rho2)(rhs(e2p))),
subtermOF(lhs(e1p), p1p), p2p))(rhs(e1p)), p1)")
(("1"
(prop)
(("1"
(expand
RC)
(("1"
(expand *
union
member)
(("1"
(flatten)
(("1"
(hide
2)
(("1"
(expand
reduction?
1)
(("1"
(inst
1
e2p
"comp(sg2, rho2)"
"p1 o (pr o p2p)" )
(("1"
(split)
(("1"
(lemma
ext_preserv_pos)
(("1"
(inst
-1
pr
"rhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(rewrite
ext_o)
(("1"
(expand
o
1
3)
(("1"
(replace
-19
1
rl)
(("1"
(replace
-14
1)
(("1"
(replaces
-8)
(("1"
(expand
o
-7)
(("1"
(replace
-3
-7
rl)
(("1"
(lemma
replace_preserv_pos)
(("1"
(inst
-1
p1
t
"ext(sg1)(ext(rho1)(rhs(e1p)))" )
(("1"
(assert )
(("1"
(lemma
subterm_of_replace)
(("1"
(inst
-1
p1
t
"ext(sg1)(ext(rho1)(rhs(e1p)))" )
(("1"
(assert )
(("1"
(replace
-19
-1
rl)
(("1"
(replace
-19
-2
rl)
(("1"
(lemma
pos_subterm)
(("1"
(inst
-1
"p1 o pr"
p2p
t1)
(("1"
(prop)
(("1"
(case
"p1 o pr o p2p = p1 o (pr o p2p)" )
(("1"
(replace
-1
1
rl)
(("1"
(replace
-2
1)
(("1"
(lemma
pos_o_term)
(("1"
(inst
-1
p1
pr
t1)
(("1"
(prop)
(("1"
(lemma
pos_subterm)
(("1"
(inst
-1
p1
pr
t1)
(("1"
(assert )
(("1"
(replaces
-1)
(("1"
(replace
-4
1)
(("1"
(replace
-9
1)
(("1"
(lemma
subterm_ext_commute)
(("1"
(inst
-1
pr
"rhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-1
1)
(("1"
(replace
-9
1)
(("1"
(replace
-22
1)
(("1"
(lemma
pos_subterm)
(("1"
(inst
-1
p1p
p2p
"ext(sg1)(ext(rho1)(lhs(e1p)))" )
(("1"
(prop)
(("1"
(replace
-1
1)
(("1"
(lemma
subterm_ext_commute)
(("1"
(inst
-1
p1p
"lhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-1
1)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
2)
(("2"
(lemma
pos_o_term)
(("2"
(inst
-1
p1p
p2p
"ext(sg1)(ext(rho1)(lhs(e1p)))" )
(("2"
(prop)
(("1"
(lemma
ext_preserv_pos)
(("1"
(inst
-1
p1p
"lhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
nil
nil ))
nil ))
nil ))
nil )
("2"
(replace
-9
-13)
(("2"
(lemma
subterm_ext_commute)
(("2"
(inst
-1
p1p
"lhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-1
1)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(replace
-3
1)
(("2"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(lemma
o_assoc[posnat])
(("2"
(inst
-1
p1
pr
p2p)
(("2"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(replace
-1
-3
rl)
(("2"
(lemma
pos_o_term)
(("2"
(inst
-1
"p1 o pr"
p2p
t1)
(("2"
(prop)
(("1"
(lemma
pos_o_term)
(("1"
(inst
-1
p1
pr
t1)
(("1"
(assert )
nil
nil ))
nil ))
nil )
("2"
(lemma
pos_o_term)
(("2"
(inst
-1
p1
pr
t1)
(("2"
(assert )
(("2"
(lemma
pos_subterm)
(("2"
(inst
-1
p1
pr
t1)
(("2"
(assert )
(("2"
(replace
-1
1)
(("2"
(replace
-3
1)
(("2"
(lemma
subterm_ext_commute)
(("2"
(inst
-1
pr
"rhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-1
1)
(("1"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
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 ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(lemma
SigmaP_vs_replaceTerm_linearR)
(("2"
(inst
-1
pr
p2p
"rhs(e1p)"
"comp(sg1, rho1)"
"ext(sg2)(ext(rho2)(rhs(e2p)))"
"subtermOF(rhs(e1p), pr)" )
(("1"
(assert )
(("1"
(replace
-3
1
rl)
(("1"
(replace
-1
1)
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-7)
(("1"
(rewrite
ext_o)
(("1"
(expand
o
1
(1
3))
(("1"
(hide
-1)
(("1"
(lemma
replace_preserv_pos)
(("1"
(inst
-1
p1
t
"ext(sg1)(ext(rho1)(rhs(e1p)))" )
(("1"
(assert )
(("1"
(lemma
subterm_of_replace)
(("1"
(inst
-1
p1
t
"ext(sg1)(ext(rho1)(rhs(e1p)))" )
(("1"
(assert )
(("1"
(replace
-19
(-1
-2)
rl)
(("1"
(replace
-1
1
rl)
(("1"
(lemma
replace_associativity)
(("1"
(inst
-1
p1
"pr o p2p"
"ext(sg2)(ext(rho2)(rhs(e2p)))"
t1
"subtermOF(t1, p1)" )
(("1"
(prop)
(("1"
(replace
-1
1
rl)
(("1"
(hide
-1)
(("1"
(lemma
replace_subterm_of_term)
(("1"
(inst
-1
p1
t1)
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide
2)
(("2"
(lemma
ext_preserv_pos)
(("2"
(inst
-1
pr
"rhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-5
-9
rl)
(("1"
(lemma
subterm_ext_commute)
(("1"
(inst
-1
pr
"rhs(e1p)"
"comp(sg1, rho1)" )
(("1"
(assert )
(("1"
(rewrite
ext_o)
(("1"
(expand
o
-1)
(("1"
(replace
-1
-10
rl)
(("1"
(hide
-1)
(("1"
(replace
-2
(-1
-9)
rl)
(("1"
(lemma
pos_o_term)
(("1"
(inst
-1
pr
p2p
"subtermOF(t1, p1)" )
(("1"
(assert )
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(hide-all-but
1)
(("2"
(rewrite
subs_o)
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 )
("2"
(hide-all-but
(-2
-5
1))
(("2"
(replaces
-1)
(("2"
(expand
V)
(("2"
(propax)
nil
nil ))
nil ))
nil ))
nil ))
nil ))
nil ))
nil )
("2"
(rewrite
ext_o)
(("2"
(expand
o
-6)
(("2"
(lemma
replace_preserv_pos)
(("2"
(inst
-1
p1
t
"ext(sg1)(ext(rho1)(rhs(e1p)))" )
(("2"
(assert )
(("2"
(replace
-18
-1
--> --------------------
--> maximum size reached
--> --------------------
Messung V0.5 in Prozent 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.701Bemerkung:
(Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können 2026-04-26)
¤
*Eine klare Vorstellung vom Zielzustand
2026-05-26