|
(mappings (reachable_TCC1 0
(reachable_TCC1-1 nil 3318087528
("" (skosimp*)
(("" (typepred "vert(G!1)")
(("" (lemma "finite_subset[T]")
((""
(inst -1 "vert(G!1)" "{y: T |
vert(G!1)(y) AND
(EXISTS (w: Seq[T](G!1)): walk_from?[T](G!1, w, x!1, y))}")
(("" (bddsimp)
(("" (hide 2)
(("" (expand "subset?")
(("" (expand "member")
(("" (skosimp*) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
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)
(is_finite const-decl "bool" finite_sets nil)
(set type-eq-decl nil sets nil)
(T formal-type-decl nil mappings nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(bool nonempty-type-eq-decl nil booleans nil)
(boolean nonempty-type-decl nil booleans 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)
(verts_in? const-decl "bool" walks nil)
(Seq type-eq-decl nil walks nil)
(walk_from? const-decl "bool" walks nil)
(member const-decl "bool" sets nil)
(subset? const-decl "bool" sets nil)
(finite_subset formula-decl nil finite_sets nil))
nil))
(reachable_subset 0
(reachable_subset-1 nil 3318087528 ("" (grind) nil nil)
((boolean nonempty-type-decl nil booleans nil)
(bool nonempty-type-eq-decl nil booleans nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(set type-eq-decl nil sets nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(= const-decl "[T, T -> boolean]" equalities nil)
(dbl const-decl "set[T]" doubletons nil)
(doubleton type-eq-decl nil doubletons nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(finite_set type-eq-decl nil finite_sets nil)
(pregraph type-eq-decl nil graphs nil)
(graph type-eq-decl nil graphs nil)
(finseq_appl const-decl "[below[length(fs)] -> T]"
finite_sequences nil)
(/= const-decl "boolean" notequal nil)
(T formal-type-decl nil mappings nil)
(edge? const-decl "bool" graphs nil)
(walk? const-decl "bool" walks nil)
(walk_from? const-decl "bool" walks nil)
(reachable const-decl "finite_set[T]" mappings nil)
(member const-decl "bool" sets nil)
(subset? const-decl "bool" sets nil)
(nil application-judgement "finite_set[T]" mappings nil))
nil))
(path_reach1 0
(path_reach1-2 "Valid3.2" 3318377422
("" (skosimp*)
(("" (split)
(("1" (flatten)
(("1" (expand "path_connected?" -1)
(("1" (skosimp*)
(("1" (expand "empty?" 1)
(("1" (expand "empty?" 1)
(("1" (skosimp*)
(("1" (inst 1 "x!1")
(("1" (expand "member" -1)
(("1"
(expand "reachable" 1)
(("1"
(split)
(("1" (propax) nil nil)
("2"
(apply-extensionality 1)
(("2"
(hide 2)
(("2"
(iff)
(("2"
(split)
(("1" (bddsimp) nil nil)
("2"
(flatten)
(("2"
(split)
(("1" (propax) nil nil)
("2"
(inst -3 "x!1" "x!2")
(("2"
(skosimp*)
(("2"
(inst 1 "w!1")
(("1"
(expand
"walk_from?"
1)
(("1"
(assert)
nil
nil))
nil)
("2"
(grind)
(("2"
(typepred
"w!1")
(("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)
("2" (flatten)
(("2" (expand "path_connected?")
(("2" (skosimp*)
(("2" (split)
(("1" (expand "empty?")
(("1" (expand "empty?")
(("1" (inst -1 "x!1")
(("1" (expand "member")
(("1" (propax) nil nil)) nil))
nil))
nil))
nil)
("2" (skosimp*)
(("2" (expand "reachable")
(("2" (typepred "y!1")
(("2" (typepred "x!2")
(("2"
(lemma
"extensionality_postulate[T,bool]")
(("2"
(inst
-1
"({y: T | vert(G!1)(y) AND (EXISTS (w: Seq(G!1)):walk_from?(G!1, w, x!1, y))})"
"vert(G!1)")
(("2"
(flatten)
(("2"
(bddsimp -2 -6)
(("1"
(hide -2)
(("1"
(hide -5)
(("1"
(inst-cp -1 "x!2")
(("1"
(bddsimp -2 -3)
(("1"
(skolem! -1)
(("1"
(inst -2 "y!1")
(("1"
(beta -2)
(("1"
(bddsimp)
(("1"
(skolem! -2)
(("1"
(lemma
"walk?_reverse")
(("1"
(inst-cp
-1
"G!1"
"x!1"
"y!1"
"w!2")
(("1"
(inst
-1
"G!1"
"x!1"
"x!2"
"w!1")
(("1"
(bddsimp)
(("1"
(hide
-1
-3)
(("1"
(skolem!)
(("1"
(skolem!
-2)
(("1"
(lemma
"walk_merge")
(("1"
(inst
-1
"G!1"
"w!4"
"w!3"
"x!2"
"y!1"
"x!1")
(("1"
(bddsimp)
(("1"
(hide
-1
-2)
(("1"
(expand
"walk_from?"
-1)
(("1"
(assert)
(("1"
(skolem!
-1)
(("1"
(expand
"walk?"
-1)
(("1"
(expand
"finseq_appl")
(("1"
(inst
1
"p!1")
(("1"
(assert)
(("1"
(flatten)
(("1"
(assert)
nil
nil))
nil))
nil)
("2"
(expand
"walk?"
1)
(("2"
(assert)
(("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)
("2" (propax) nil nil))
nil))
nil))
nil))
nil)
("2" (propax) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((path_connected? const-decl "bool" graph_conn_defs nil)
(empty? const-decl "bool" graphs nil)
(member const-decl "bool" sets nil)
(NOT const-decl "[bool -> bool]" booleans 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)
(below type-eq-decl nil naturalnumbers nil)
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(nil application-judgement "finite_set[T]" mappings nil)
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(finseq_appl const-decl "[below[length(fs)] -> T]"
finite_sequences nil)
(edge? const-decl "bool" graphs nil)
(int_minus_int_is_int application-judgement "int" integers
nil)
(w!1 skolem-const-decl "Walk[T](G!1)" mappings nil)
(Walk type-eq-decl nil walks nil)
(walk? const-decl "bool" walks nil)
(x!2 skolem-const-decl "T" mappings nil)
(G!1 skolem-const-decl "graph[T]" mappings nil)
(bool nonempty-type-eq-decl nil booleans nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(set type-eq-decl nil sets 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)
(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)
(verts_in? const-decl "bool" walks nil)
(Seq type-eq-decl nil walks nil)
(walk_from? const-decl "bool" walks nil)
(boolean nonempty-type-decl nil booleans nil)
(reachable const-decl "finite_set[T]" mappings nil)
(T formal-type-decl nil mappings nil)
(empty? const-decl "bool" sets nil)
(walk?_reverse formula-decl nil walks nil)
(p!1 skolem-const-decl "prewalk[T]" mappings nil)
(nil application-judgement "finite_set[T]" graphs nil)
(walk_merge formula-decl nil walks nil)
(extensionality_postulate formula-decl nil functions nil))
shostak)
(path_reach1-1 nil 3318087528
("" (skosimp*)
(("" (split)
(("1" (flatten)
(("1" (expand "path_connected?" -1)
(("1" (skosimp*)
(("1" (expand "empty?" 1)
(("1" (expand "empty?" 1)
(("1" (skosimp*)
(("1" (inst 1 "x!1")
(("1" (expand "member" -1)
(("1"
(expand "reachable" 1)
(("1"
(split)
(("1" (propax) nil nil)
("2"
(apply-extensionality 1)
(("2"
(hide 2)
(("2"
(iff)
(("2"
(split)
(("1" (bddsimp) nil nil)
("2"
(flatten)
(("2"
(split)
(("1" (propax) nil nil)
("2"
(inst -3 "x!1" "x!2")
(("2"
(skosimp*)
(("2"
(inst 1 "w!1")
(("1"
(expand
"walk_from?"
1)
(("1"
(assert)
nil
nil))
nil)
("2"
(grind)
(("2"
(typepred
"w!1")
(("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)
("2" (flatten)
(("2" (expand "path_connected?")
(("2" (skosimp*)
(("2" (split)
(("1" (expand "empty?")
(("1" (expand "empty?")
(("1" (inst -1 "x!1")
(("1" (expand "member")
(("1" (propax) nil nil)) nil))
nil))
nil))
nil)
("2" (skosimp*)
(("2" (expand "reachable")
(("2" (typepred "y!1")
(("2" (typepred "x!2")
(("2"
(lemma
"extensionality_postulate[T,bool]")
(("2"
(inst
-1
"({y: T | vert(G!1)(y) AND (EXISTS (w: Seq(G!1)):walk_from?(G!1, w, x!1, y))})"
"vert(G!1)")
(("2"
(flatten)
(("2"
(bddsimp -2 -6)
(("1"
(hide -2)
(("1"
(hide -5)
(("1"
(inst-cp -1 "x!2")
(("1"
(bddsimp -2 -3)
(("1"
(beta -1)
(("1"
(bddsimp)
(("1"
(skolem! -1)
(("1"
(inst -3 "y!1")
(("1"
(beta -3)
(("1"
(bddsimp -3)
(("1"
(skolem!
-1)
(("1"
(lemma
"walk?_reverse")
(("1"
(inst-cp
-1
"G!1"
"x!1"
"y!1"
"w!2")
(("1"
(inst
-1
"G!1"
"x!1"
"x!2"
"w!1")
(("1"
(bddsimp)
(("1"
(hide
-1
-3)
(("1"
(skolem!)
(("1"
(skolem!
-2)
(("1"
(lemma
"walk_merge")
(("1"
(inst
-1
"G!1"
"w!4"
"w!3"
"x!2"
"y!1"
"x!1")
(("1"
(bddsimp)
(("1"
(hide
-1
-2)
(("1"
(expand
"walk_from?"
-1)
(("1"
(assert)
(("1"
(skolem!
-1)
(("1"
(expand
"walk?"
-1)
(("1"
(expand
"finseq_appl")
(("1"
(inst
1
"p!1")
(("1"
(assert)
(("1"
(flatten)
(("1"
(assert)
nil
nil))
nil))
nil)
("2"
(expand
"walk?"
1)
(("2"
(assert)
(("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)
("2" (propax) nil nil))
nil))
nil))
nil))
nil)
("2" (propax) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((path_connected? const-decl "bool" graph_conn_defs nil)
(empty? const-decl "bool" graphs nil)
(edge? const-decl "bool" graphs nil)
(Walk type-eq-decl nil walks nil)
(walk? const-decl "bool" walks nil)
(dbl const-decl "set[T]" doubletons nil)
(doubleton type-eq-decl nil doubletons nil)
(pregraph type-eq-decl nil graphs nil)
(graph type-eq-decl nil graphs nil)
(prewalk type-eq-decl nil walks nil)
(verts_in? const-decl "bool" walks nil)
(Seq type-eq-decl nil walks nil)
(walk_from? const-decl "bool" walks nil)
(walk?_reverse formula-decl nil walks nil)
(walk_merge formula-decl nil walks nil))
nil))
(path_reach2 0
(path_reach2-1 nil 3318087528
("" (skosimp*)
(("" (split)
(("1" (flatten)
(("1" (expand "path_connected?" -1)
(("1" (skosimp*)
(("1" (expand "empty?" 1)
(("1" (expand "empty?" 1)
(("1" (expand "member" 1)
(("1" (skosimp*)
(("1" (expand "reachable" 1)
(("1"
(split)
(("1"
(skosimp*)
(("1"
(apply-extensionality 1)
(("1"
(hide 2)
(("1"
(iff 1)
(("1"
(split)
(("1" (bddsimp) nil nil)
("2"
(bddsimp)
(("2"
(inst -4 "x!2" "x!3")
(("2"
(expand
"walk_from?"
+)
(("2"
(grind)
(("2"
(typepred "w!1")
(("2"
(expand
"walk?"
-2)
(("2"
(flatten)
(("2"
(expand
"verts_in?"
-2)
(("2"
(inst
-2
"i!1")
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))
nil))
nil)
("2" (flatten)
(("2" (lemma "path_reach1")
(("2" (inst -1 "G!1")
(("2" (flatten)
(("2" (hide -1)
(("2" (copy 2)
(("2" (expand "path_connected?" 1)
(("2" (split)
(("1" (propax) nil nil)
("2"
(expand "empty?" 2)
(("2"
(expand "empty?" 2)
(("2"
(hide 1)
(("2"
(skosimp*)
(("2"
(expand "member" -)
(("2"
(inst -2 "x!1")
(("2"
(bddsimp)
(("2"
(inst 1 "x!1")
(("2" (assert) nil nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
((path_connected? const-decl "bool" graph_conn_defs nil)
(empty? const-decl "bool" graphs nil)
(member const-decl "bool" sets nil)
(reachable const-decl "finite_set[T]" mappings nil)
(G!1 skolem-const-decl "graph[T]" mappings nil)
(x!3 skolem-const-decl "T" mappings nil)
(walk? const-decl "bool" walks nil)
(edge? const-decl "bool" graphs nil)
(finseq_appl const-decl "[below[length(fs)] -> T]"
finite_sequences nil)
(nil application-judgement "finite_set[T]" mappings nil)
(posint_plus_nnint_is_posint application-judgement
"posint" integers nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(Walk type-eq-decl nil walks nil)
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(int_minus_int_is_int application-judgement "int" integers
nil)
(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)
(< const-decl "bool" reals nil)
(below type-eq-decl nil naturalnumbers 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)
(w!1 skolem-const-decl "Walk[T](G!1)" mappings nil)
(bool nonempty-type-eq-decl nil booleans nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(set type-eq-decl nil sets 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)
(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)
(verts_in? const-decl "bool" walks nil)
(Seq type-eq-decl nil walks nil)
(walk_from? const-decl "bool" walks nil)
(T formal-type-decl nil mappings nil)
(boolean nonempty-type-decl nil booleans nil)
(empty? const-decl "bool" sets nil)
(path_reach1 formula-decl nil mappings nil))
nil))
(reachable_conn 0
(reachable_conn-2 "V3.2 ran" 3319386050
("" (skosimp*)
(("" (lemma "conn_eq_path[T]")
(("" (inst -1 "subgraph(G!1, reachable(G!1, x!1))")
(("" (iff -1)
(("" (bddsimp)
(("" (hide 1)
(("" (expand "path_connected?")
(("" (bddsimp)
(("1" (install-rewrites "subgraphs")
(("1" (assert)
(("1"
(inst -1 "x!1")
(("1"
(bddsimp)
(("1"
(inst
1
"(#length := 1, seq :=(LAMBDA (i:below(1)): x!1)#)")
(("1" (assert) nil nil))
nil)
("2"
(typepred "x!1")
(("2" (propax) nil nil))
nil))
nil))
nil))
nil))
nil)
("2" (skosimp*)
(("2" (typepred "x!2")
(("2"
(typepred "y!1")
(("2"
(expand "subgraph" -)
(("2"
(flatten)
(("2"
(expand "reachable" -)
(("2"
(bddsimp)
(("2"
(skosimp*)
(("2"
(lemma "walk?_reverse")
(("2"
(inst-cp
-1
"G!1"
"x!1"
"y!1"
"w!1")
(("2"
(inst
-1
"G!1"
"x!1"
"x!2"
"w!2")
(("2"
(bddsimp)
(("2"
(skosimp*)
(("2"
(lemma
"walk_merge")
(("2"
(inst
-1
"G!1"
"w!4"
"w!3"
"x!2"
"y!1"
"x!1")
(("2"
(bddsimp)
(("2"
(skosimp*)
(("2"
(inst
1
"p!1")
(("1"
(install-rewrites
"walks")
(("1"
(assert)
(("1"
(bddsimp)
nil
nil))
nil))
nil)
("2"
(assert)
(("2"
(install-rewrites
"walks")
(("2"
(assert)
(("2"
(skosimp*)
(("2"
(bddsimp)
(("1"
(skosimp*)
(("1"
(bddsimp)
(("1"
(typepred
"p!1")
(("1"
(inst
-11
"n!1")
(("1"
(bddsimp)
nil
nil))
nil))
nil)
("2"
(skosimp*)
(("2"
(inst-cp
-9
"n!1")
(("1"
(inst
-9
"1+n!1")
(("1"
(hide
-3
-4
-5
-6)
(("1"
(bddsimp
(-2
-5
-6
1))
(("1"
(hide
-8
-9
-11
-12)
(("1"
(reveal
-10
-11)
(("1"
(reveal
(-1
-2
-7
-8))
(("1"
(lemma
"walk?_caret")
(("1"
(inst
-1
"G!1"
"0"
"n!1"
"p!1")
(("1"
(stop-rewrite)
(("1"
(assert)
(("1"
(case
"walk?(G!1,p!1)")
(("1"
(bddsimp)
(("1"
(inst
-8
"G!1"
"x!2"
"x!3"
"p!1 ^ (0, n!1)")
(("1"
(expand
"walk_from?"
-8)
(("1"
(expand
--> --------------------
--> maximum size reached
--> --------------------
¤ Dauer der Verarbeitung: 0.144 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.
|
