|
(k_menger
(sep_num_B 0
(sep_num_B-1 nil 3375303932
("" (skosimp*)
(("" (expand "B")
(("" (prop)
(("" (copy -1)
(("" (inst -3 "min_sep_set(G!1,s!1,t!1)")
(("" (expand "sep_num")
(("" (lemma "min_sep_set_card")
(("" (inst?)
(("1" (bddsimp)
(("1" (lemma "min_sep_set_seps")
(("1" (inst?)
(("1" (prop)
(("1" (expand "good?") (("1" (prop) nil nil))
nil))
nil))
nil))
nil))
nil)
("2" (expand "good?") (("2" (bddsimp) nil nil)) nil)
("3" (expand "good?") (("3" (bddsimp) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((B const-decl "bool" k_menger nil)
(sep_num const-decl "nat" sep_sets nil)
(G!1 skolem-const-decl "graph[T]" k_menger nil)
(s!1 skolem-const-decl "T" k_menger nil)
(t!1 skolem-const-decl "T" k_menger nil)
(min_sep_set_seps formula-decl nil sep_sets nil)
(good? const-decl "bool" k_menger nil)
(min_sep_set_card formula-decl nil sep_sets nil)
(min_sep_set const-decl "finite_set[T]" sep_sets nil)
(graph type-eq-decl nil graphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(pregraph type-eq-decl nil graphs nil)
(doubleton type-eq-decl nil doubletons nil)
(dbl const-decl "set[T]" doubletons nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(/= const-decl "boolean" notequal nil)
(AND const-decl "[bool, bool -> bool]" booleans 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)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans nil)
(T formal-type-decl nil k_menger nil))
shostak))
(sep_num_implies 0
(sep_num_implies-1 nil 3379680344
("" (skosimp*)
(("" (expand "B")
(("" (prop)
(("" (skosimp*)
(("" (lemma "min_sep_set_card")
(("" (inst?)
(("1" (expand "sep_num")
(("1" (prop) (("1" (assert) nil nil)) nil)) nil)
("2" (expand "good?") (("2" (prop) nil nil)) nil)
("3" (expand "good?") (("3" (prop) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil)
((B const-decl "bool" k_menger nil)
(s!1 skolem-const-decl "T" k_menger nil)
(G!1 skolem-const-decl "graph[T]" k_menger nil)
(graph type-eq-decl nil graphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(pregraph type-eq-decl nil graphs nil)
(finite_set type-eq-decl nil finite_sets nil)
(doubleton type-eq-decl nil doubletons nil)
(dbl const-decl "set[T]" doubletons nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(/= const-decl "boolean" notequal nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(set type-eq-decl nil sets nil)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans nil)
(t!1 skolem-const-decl "T" k_menger nil)
(is_finite const-decl "bool" finite_sets nil)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(sep_num const-decl "nat" sep_sets nil)
(good? const-decl "bool" k_menger nil)
(min_sep_set_card formula-decl nil sep_sets nil)
(T formal-type-decl nil k_menger nil))
shostak))
(card_extension_W 0
(card_extension_W-1 nil 3389097760
("" (skosimp*)
(("" (lemma "card_extension[T,(W!1)]")
(("" (inst -1 "V!1")
(("" (expand "restrict")
(("" (expand "extend")
((""
(case "(LAMBDA (t: T): IF (W!1)(t) THEN V!1(t) ELSE FALSE ENDIF)=V!1")
(("1" (replace -1 1 lr) (("1" (propax) nil nil)) nil)
("2" (hide 2)
(("2" (apply-extensionality 1 :hide? t)
(("2" (iff)
(("2" (prop)
(("2" (expand "subset?")
(("2" (inst? -3)
(("2" (expand "member")
(("2" (prop) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((finite_set type-eq-decl nil finite_sets nil)
(is_finite const-decl "bool" finite_sets nil)
(set type-eq-decl nil sets nil)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans nil)
(T formal-type-decl nil k_menger nil)
(card_extension formula-decl nil finite_sets_card_from nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(IF const-decl "[boolean, T, T -> T]" if_def nil)
(FALSE const-decl "bool" booleans nil)
(subset_is_partial_order name-judgement "(partial_order?[set[T]])"
sets_lemmas nil)
(member const-decl "bool" sets nil)
(subset? const-decl "bool" sets nil)
(extend const-decl "R" extend nil)
(restrict const-decl "R" restrict nil)
(finite_restrict application-judgement "finite_set[S]"
restrict_set_props nil))
shostak))
(card_extension_same 0
(card_extension_same-1 nil 3389098779
("" (skosimp*)
(("" (lemma "card_extension_W")
(("" (inst -1 "W!1" "W!1")
(("" (prop) (("" (hide 2) (("" (grind) nil nil)) nil)) nil))
nil))
nil))
nil)
((card_extension_W formula-decl nil k_menger nil)
(subset_is_partial_order name-judgement "(partial_order?[set[T]])"
sets_lemmas nil)
(member const-decl "bool" sets nil)
(subset? const-decl "bool" sets 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)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans nil)
(T formal-type-decl nil k_menger nil))
shostak))
(easy_menger_B 0
(easy_menger_B-2 "sec" 3379689668
("" (skosimp*)
(("" (lemma "easy_menger[T]")
(("" (expand "many_ind")
(("" (skosimp*)
(("" (inst -1 "G!1" "s!1" "t!1" "ips!1")
(("" (expand "B")
(("" (prop)
(("1" (expand "st_path_set?")
(("1"
(lemma
"finite_sets_card_eq[prewalk,Path_from[T](G!1, s!1, t!1)].card_eq_bij")
(("1" (expand "restrict")
(("1"
(inst -1 "ips!1"
"LAMBDA (s: Path_from[T](G!1, s!1, t!1)): ips!1(s)")
(("1" (prop)
(("1" (replace -1 -3 rl)
(("1" (replace -7 -3 lr)
(("1"
(lemma "min_sep_set_card")
(("1"
(skosimp*)
(("1"
(inst?)
(("1"
(expand "sep_num")
(("1"
(prop)
(("1" (assert) nil nil))
nil))
nil)
("2"
(expand "good?")
(("2" (prop) nil nil))
nil)
("3"
(expand "good?")
(("3" (prop) nil nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2" (hide -1 -3 -5 2 3)
(("2" (inst 1 "LAMBDA (p1:(ips!1)) :p1")
(("1" (grind) nil nil)
("2" (grind) nil nil))
nil))
nil))
nil)
("2" (hide -1 -3 -5 2)
(("2" (typepred "ips!1")
(("2"
(lemma
"restrict_set_props[prewalk,Path_from[T](G!1, s!1, t!1)].restrict_finite")
(("2"
(inst -1 "ips!1")
(("2"
(prop)
(("2"
(expand "restrict")
(("2" (propax) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2" (expand "good?") (("2" (prop) nil nil)) nil)
("3" (hide -4 1) (("3" (grind) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((T formal-type-decl nil k_menger nil)
(easy_menger formula-decl nil easy_menger nil)
(B const-decl "bool" k_menger nil)
(ind_prewalk_set? const-decl "bool" k_menger nil)
(ind_path_set? const-decl "bool" ind_paths nil)
(independent? const-decl "bool" ind_paths nil)
(st_path_set? const-decl "bool" k_menger nil)
(restrict_finite formula-decl nil restrict_set_props nil)
(good? const-decl "bool" k_menger nil)
(sep_num const-decl "nat" sep_sets nil)
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(min_sep_set_card formula-decl nil sep_sets nil)
(int_minus_int_is_int application-judgement "int" integers nil)
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(below type-eq-decl nil naturalnumbers nil)
(< const-decl "bool" reals nil) (>= const-decl "bool" reals nil)
(int nonempty-type-eq-decl nil integers nil)
(integer_pred const-decl "[rational -> boolean]" integers nil)
(rational nonempty-type-from-decl nil rationals nil)
(rational_pred const-decl "[real -> boolean]" rationals nil)
(odd_plus_even_is_odd application-judgement "odd_int" integers nil)
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(posint_plus_nnint_is_posint application-judgement "posint"
integers nil)
(from? const-decl "bool" walks nil)
(path? const-decl "bool" paths nil)
(walk? const-decl "bool" walks nil)
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil)
(verts_in? const-decl "bool" walks nil)
(separable? const-decl "bool" sep_sets nil)
(edge? const-decl "bool" graphs nil)
(bijective? const-decl "bool" functions nil)
(surjective? const-decl "bool" functions nil)
(injective? const-decl "bool" functions nil)
(nil application-judgement "finite_set[T]" k_menger nil)
(nil application-judgement "finite_set[T]" graphs nil)
(ips!1 skolem-const-decl "set_of_prewalks" k_menger nil)
(t!1 skolem-const-decl "T" k_menger nil)
(s!1 skolem-const-decl "T" k_menger nil)
(G!1 skolem-const-decl "graph[T]" k_menger nil)
(card_eq_bij formula-decl nil finite_sets_card_eq "finite_sets/")
(set_of_prewalks type-eq-decl nil k_menger nil)
(restrict const-decl "R" restrict nil)
(set_of_paths type-eq-decl nil ind_paths nil)
(is_finite const-decl "bool" finite_sets nil)
(Path_from type-eq-decl nil paths nil)
(path_from? const-decl "bool" paths nil)
(prewalk type-eq-decl nil walks nil)
(> const-decl "bool" reals nil)
(real nonempty-type-from-decl nil reals nil)
(real_pred const-decl "[number_field -> boolean]" reals nil)
(number_field nonempty-type-from-decl nil number_fields nil)
(number_field_pred const-decl "[number -> boolean]" number_fields
nil)
(number nonempty-type-decl nil numbers nil)
(finseq type-eq-decl nil finite_sequences nil)
(below type-eq-decl nil nat_types nil)
(nat nonempty-type-eq-decl nil naturalnumbers nil)
(graph type-eq-decl nil graphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(pregraph type-eq-decl nil graphs nil)
(finite_set type-eq-decl nil finite_sets nil)
(doubleton type-eq-decl nil doubletons nil)
(dbl const-decl "set[T]" doubletons nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(/= const-decl "boolean" notequal nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(set type-eq-decl nil sets nil)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans nil)
(finite_restrict application-judgement "finite_set[S]"
restrict_set_props nil)
(many_ind const-decl "bool" k_menger nil))
shostak)
(easy_menger_B-1 nil 3379687287
("" (skosimp*)
(("" (lemma "easy_menger")
(("" (expand "many_ind")
(("" (skosimp*)
(("" (inst -1 "G!1" "s!1" "t!1" "ips!1")
(("" (prop)
(("1" (expand "B")
(("1" (prop)
(("1" (postpone) nil nil) ("2" (postpone) nil nil))
nil))
nil)
("2" (postpone) nil nil) ("3" (postpone) nil nil))
nil))
nil))
nil))
nil))
nil))
nil)
nil shostak))
(sep_set_small 0
(sep_set_small-1 nil 3379682439
("" (skosimp*)
(("" (expand "B")
(("" (prop)
(("" (inst?)
(("" (prop)
(("1" (assert) nil nil)
("2" (expand "separates")
(("2" (expand "green?")
(("2" (prop)
(("2" (skosimp*)
(("2" (lemma "walk_to_path")
(("2" (inst -1 "del_verts(G!1,V!1)" "s!1" "t!1")
(("2" (prop)
(("1" (skosimp*)
(("1" (hide -3 -4 -5)
(("1"
(expand "walk_from?")
(("1"
(prop)
(("1"
(inst 3 "p!1")
(("1"
(expand "path_from?")
(("1"
(prop)
(("1"
(expand "from?")
(("1" (assert) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2" (hide -2 -3 4)
(("2" (inst 1 "w!1") nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((B const-decl "bool" k_menger nil)
(T formal-type-decl nil k_menger nil)
(boolean nonempty-type-decl nil booleans nil)
(bool nonempty-type-eq-decl nil booleans nil)
(set type-eq-decl nil sets nil)
(is_finite const-decl "bool" finite_sets nil)
(finite_set type-eq-decl nil finite_sets nil)
(separates const-decl "bool" sep_sets nil)
(walk_to_path formula-decl nil path_ops nil)
(path_from? const-decl "bool" paths nil)
(from? const-decl "bool" walks nil)
(int_minus_int_is_int application-judgement "int" integers 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)
(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)
(prewalk type-eq-decl nil walks nil)
(walk_from? const-decl "bool" walks nil)
(del_verts const-decl "graph[T]" sep_sets nil)
(graph type-eq-decl nil graphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(pregraph type-eq-decl nil graphs nil)
(doubleton type-eq-decl nil doubletons nil)
(dbl const-decl "set[T]" doubletons nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(/= const-decl "boolean" notequal nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(green? const-decl "bool" k_menger nil)
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props nil))
shostak))
(B_many_1 0
(B_many_1-1 nil 3379681920
("" (skosimp*)
(("" (expand "B_many")
(("" (prop)
(("" (expand "many_ind")
(("" (lemma "sep_set_small")
(("" (expand "B")
(("" (prop)
(("" (inst -1 "G!1" "_" "1" "s!1" "t!1")
(("" (inst -1 "emptyset[T]")
(("" (prop)
(("1" (expand "del_verts")
(("1" (expand "difference")
(("1" (expand "member")
(("1" (assert)
(("1"
(expand "emptyset")
(("1"
(skosimp*)
(("1"
(inst 1 "singleton[prewalk](p!1)")
(("1"
(hide -2 -3)
(("1"
(lemma
"card_singleton[prewalk]")
(("1"
(inst -1 "p!1")
(("1"
(prop)
(("1"
(expand
"ind_prewalk_set?")
(("1"
(skosimp*)
(("1"
(expand "singleton")
(("1"
(assert)
nil
nil))
nil))
nil))
nil)
("2"
(expand "st_path_set?")
(("2"
(hide -1)
(("2"
(skosimp*)
(("2"
(expand
"singleton")
(("2"
(replace -1 * lr)
(("2"
(install-rewrites
"paths")
(("2"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2" (hide -1 -2 2)
(("2" (lemma "card_emptyset[T]")
(("2" (assert)
(("2" (expand "green?")
(("2"
(prop)
(("1"
(assert)
(("1"
(expand "emptyset")
(("1" (propax) nil nil))
nil))
nil)
("2"
(expand "emptyset")
(("2" (propax) nil nil))
nil))
nil))
nil))
nil))
nil))
nil)
("3" (lemma "card_emptyset[T]")
(("3" (assert) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((B_many const-decl "bool" k_menger nil)
(many_ind const-decl "bool" k_menger nil)
(B const-decl "bool" k_menger nil)
(T formal-type-decl nil k_menger nil)
(boolean nonempty-type-decl nil booleans nil)
(bool nonempty-type-eq-decl nil booleans nil)
(set type-eq-decl nil sets nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(/= const-decl "boolean" notequal nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(dbl const-decl "set[T]" doubletons nil)
(doubleton type-eq-decl nil doubletons nil)
(finite_set type-eq-decl nil finite_sets nil)
(pregraph type-eq-decl nil graphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(graph type-eq-decl nil graphs 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)
(difference const-decl "set" sets nil)
(st_path_set? const-decl "bool" k_menger nil)
(path_from? const-decl "bool" paths nil)
(from? const-decl "bool" walks nil)
(path? const-decl "bool" paths nil)
(walk? const-decl "bool" walks nil)
(edge? const-decl "bool" graphs nil)
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil)
(verts_in? const-decl "bool" walks nil)
(nil application-judgement "finite_set[T]" graphs nil)
(int_minus_int_is_int application-judgement "int" integers nil)
(nil application-judgement "finite_set[T]" k_menger nil)
(ind_prewalk_set? const-decl "bool" k_menger nil)
(card_singleton formula-decl nil finite_sets nil)
(below type-eq-decl nil nat_types nil)
(finseq type-eq-decl nil finite_sequences nil)
(> const-decl "bool" reals nil)
(prewalk type-eq-decl nil walks nil)
(set_of_prewalks type-eq-decl nil k_menger nil)
(singleton? const-decl "bool" sets nil)
(singleton const-decl "(singleton?)" sets nil)
(nonempty_singleton_finite application-judgement
"non_empty_finite_set" finite_sets nil)
(member const-decl "bool" sets nil)
(del_verts const-decl "graph[T]" sep_sets nil)
(card_emptyset formula-decl nil finite_sets nil)
(green? const-decl "bool" k_menger nil)
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(is_finite const-decl "bool" finite_sets nil)
(emptyset const-decl "set" sets nil)
(finite_emptyset name-judgement "finite_set" finite_sets nil)
(finite_emptyset name-judgement "finite_set[T]" k_menger nil)
(sep_set_small formula-decl nil k_menger nil))
shostak))
(sub_tight 0
(sub_tight-1 nil 3379015166
("" (skosimp*)
(("" (expand "tight?")
(("" (expand "subset?")
(("" (skosimp*)
(("" (expand "member")
(("" (inst -1 "x!1")
(("" (inst -2 "x!1") (("" (prop) nil nil)) nil)) nil))
nil))
nil))
nil))
nil))
nil)
((tight? const-decl "bool" k_menger nil)
(T formal-type-decl nil k_menger nil)
(member const-decl "bool" sets nil)
(subset? const-decl "bool" sets nil))
shostak))
(smaller_tight 0
(smaller_tight-3 "good" 3378204176
("" (skosimp*)
(("" (expand "tight?")
(("" (expand "subset?")
(("" (expand "member")
(("" (skosimp*)
(("" (expand "intersection")
(("" (expand "member")
(("" (inst 2 "remove(x!1,W!1)")
(("" (prop)
(("1" (skosimp*)
(("1" (expand "remove")
(("1" (prop)
(("1" (expand "member")
(("1" (propax) nil nil)) nil))
nil))
nil))
nil)
("2" (expand "remove")
(("2" (expand "member")
(("2" (hide -2 1)
(("2" (grind)
(("2" (decompose-equality -1)
(("2"
(inst -1 "x!1")
(("2"
(iff)
(("2" (prop) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("3" (expand "separates")
(("3" (prop)
(("1" (expand "remove")
(("1" (expand "member")
(("1" (prop) nil nil)) nil))
nil)
("2" (expand "remove")
(("2" (expand "member")
(("2" (prop) nil nil)) nil))
nil)
("3" (skosimp*)
(("3" (expand "walk_from?")
(("3" (prop)
(("3"
(inst 4 "w!1")
(("3"
(prop)
(("3"
(case "verts_of(w!1)(x!1)")
(("1"
(hide -4)
(("1"
(hide 1)
(("1"
(expand "path_verts")
(("1"
(expand "verts_of")
(("1"
(skosimp*)
(("1"
(expand "finseq_appl")
(("1"
(inst
1
"w!1^(0,i!1)")
(("1"
(expand
"walk_from?")
(("1"
(prop)
(("1"
(expand*
"^"
min
empty_seq)
nil
nil)
("2"
(expand*
"^"
min
empty_seq)
nil
nil)
("3"
(reveal -1)
(("3"
(lemma
"walk?_caret")
(("3"
(inst
-1
"G!1"
"0"
"i!1"
"w!1")
(("3"
(typepred
"i!1")
(("3"
(assert)
(("3"
(lemma
"walk?_subgraph")
(("3"
(inst
-1
"G!1"
"del_verts(G!1, remove(x!1, W!1))"
"w!1")
(("3"
(prop)
(("3"
(hide
-2
2
3)
(("3"
(assert)
(("3"
(install-rewrites
"finite_sets[T]")
(("3"
(assert)
(("3"
(prop)
(("1"
(skosimp*)
nil
nil)
("2"
(skosimp*)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(grind)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(hide 3)
(("2"
(install-rewrites "walks")
(("2"
(expand "walk?")
(("2"
(expand "finseq_appl")
(("2"
(prop)
(("1"
(expand "verts_in?")
(("1"
(skosimp*)
(("1"
(expand
"del_verts")
(("1"
(typepred "i!1")
(("1"
(hide -5)
(("1"
(inst
-4
"i!1")
(("1"
(expand
"verts_of")
(("1"
(expand
"finseq_appl")
(("1"
(expand
"difference")
(("1"
(expand
"member")
(("1"
(prop)
(("1"
(inst
1
"i!1")
(("1"
(expand
"remove")
(("1"
(expand
"member")
(("1"
(prop)
(("1"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(skosimp*)
(("2"
(inst -5 "n!1")
(("2"
(prop)
(("2"
(expand
"verts_of")
(("2"
(expand
"finseq_appl")
(("2"
(expand
"edge?")
(("2"
(prop)
(("2"
(hide -5)
(("2"
(expand
"del_verts")
(("2"
(prop)
(("2"
(skosimp*)
(("2"
(copy
-4)
(("2"
(inst
-1
"seq(w!1)(n!1)")
(("2"
(inst
-5
"seq(w!1)(n!1 + 1)")
(("1"
(prop)
(("1"
(assert)
nil
nil)
("2"
(assert)
nil
nil)
("3"
(assert)
nil
nil)
("4"
(assert)
(("4"
(prop)
(("1"
(assert)
nil
nil)
("2"
(assert)
nil
nil)
("3"
(assert)
nil
nil)
("4"
(assert)
(("4"
(inst
3
"1+n!1")
(("4"
(assert)
nil
nil))
nil))
nil)
("5"
(inst
3
"n!1")
(("5"
(assert)
nil
nil))
nil)
("6"
(inst
3
"n!1")
(("6"
(assert)
nil
nil))
nil)
("7"
(replace
-1
-2
lr)
(("7"
(propax)
nil
nil))
nil)
("8"
(replace
-1
-2
lr)
(("8"
(propax)
nil
nil))
nil))
nil))
nil))
nil)
("2"
(grind)
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)
("4" (skosimp*)
(("4" (hide -2 2)
(("4" (expand "remove")
(("4" (expand "member")
(("4" (prop) nil nil)) nil))
nil))
nil))
nil)
("5" (hide -2 1)
(("5" (expand "remove")
(("5" (decompose-equality -1)
(("5" (inst?)
(("5" (expand "member")
(("5" (propax) nil nil)) nil))
nil))
nil))
nil))
nil)
("6" (expand "separates")
(("6" (prop)
(("1" (expand "remove")
(("1" (expand "member")
(("1" (prop) nil nil)) nil))
nil)
("2" (expand "remove")
(("2" (expand "member")
(("2" (prop) nil nil)) nil))
nil)
("3" (skosimp*)
(("3" (expand "walk_from?")
(("3" (prop)
(("3"
(inst 4 "w!1")
(("3"
(prop)
(("3"
(case "verts_of(w!1)(x!1)")
(("1"
(hide -4)
(("1"
(hide 1)
(("1"
(expand "path_verts")
(("1"
(expand "verts_of")
(("1"
(expand "finseq_appl")
(("1"
(skosimp*)
(("1"
(inst
1
"rev(w!1)^(0,length(w!1)-1-i!1)")
(("1"
(expand
"walk_from?")
(("1"
(prop)
(("1"
(expand "rev")
(("1"
(expand*
"^"
min
empty_seq)
nil
nil))
nil)
("2"
(expand "rev")
(("2"
(expand*
"^"
min
empty_seq)
nil
nil))
nil)
("3"
(reveal -1)
(("3"
(lemma
"walk?_caret")
(("3"
(lemma
"walk?_rev")
(("3"
(inst
-1
"G!1"
"w!1")
(("3"
(inst
-2
"G!1"
"0"
"length(w!1)-1-i!1"
"rev(w!1)")
(("1"
(typepred
"i!1")
(("1"
(assert)
(("1"
(lemma
"walk?_subgraph")
(("1"
(inst
-1
"G!1"
"del_verts(G!1, remove(x!1, W!1))"
"w!1")
(("1"
(prop)
(("1"
(lemma
"walk?_caret")
(("1"
(inst
-1
"G!1"
"0"
"length(w!1)-1-i!1"
"rev(w!1)")
(("1"
(assert)
(("1"
(expand
"rev")
(("1"
(assert)
nil
nil))
nil))
nil))
nil))
nil)
("2"
(expand
"rev")
(("2"
(assert)
nil
nil))
nil)
("3"
(expand
"rev")
(("3"
(assert)
nil
nil))
nil)
("4"
(hide
-2
1
2
4)
(("4"
(grind)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(expand
"rev")
(("2"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
--> --------------------
--> maximum size reached
--> --------------------
¤ Dauer der Verarbeitung: 0.40 Sekunden
(vorverarbeitet)
¤
|
Haftungshinweis
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
|
