(subtrees
(walk_acr_TCC1 0
(walk_acr_TCC1-1 nil 3301756562 ("" (subtype-tcc) nil nil) nil nil))
(walk_acr_TCC2 0
(walk_acr_TCC2-1 nil 3301756562 ("" (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)
(T formal-type-decl nil subtrees nil)
(edgetype type-eq-decl nil digraphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(finite_set type-eq-decl nil finite_sets nil)
(predigraph type-eq-decl nil digraphs nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(digraph type-eq-decl nil digraphs nil)
(set type-eq-decl nil sets nil)
(nonempty? const-decl "bool" sets nil)
(Digraph type-eq-decl nil digraphs 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)
(finseq type-eq-decl nil finite_sequences nil)
(prewalk type-eq-decl nil walks nil)
(walk? const-decl "bool" walks nil)
(Walk type-eq-decl nil walks nil)
(real_gt_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)
(real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(int_minus_int_is_int application-judgement "int" integers nil)
(edge? const-decl "bool" digraphs nil)
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil)
(verts_in? const-decl "bool" walks nil)
(empty? const-decl "bool" sets nil)
(member const-decl "bool" sets nil)
(nonneg_int nonempty-type-eq-decl nil integers nil)
(posnat nonempty-type-eq-decl nil integers nil))
nil))
(walk_acr_TCC3 0
(walk_acr_TCC3-1 nil 3301756562 ("" (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)
(T formal-type-decl nil subtrees nil)
(edgetype type-eq-decl nil digraphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(finite_set type-eq-decl nil finite_sets nil)
(predigraph type-eq-decl nil digraphs nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(digraph type-eq-decl nil digraphs nil)
(set type-eq-decl nil sets nil)
(nonempty? const-decl "bool" sets nil)
(Digraph type-eq-decl nil digraphs 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)
(finseq type-eq-decl nil finite_sequences nil)
(prewalk type-eq-decl nil walks nil)
(walk? const-decl "bool" walks nil)
(Walk type-eq-decl nil walks nil)
(real_gt_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)
(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)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(edge? const-decl "bool" digraphs nil)
(finseq_appl const-decl "[below[length(fs)] -> T]" finite_sequences
nil)
(verts_in? const-decl "bool" walks nil)
(empty? const-decl "bool" sets nil)
(member const-decl "bool" sets nil)
(nonneg_int nonempty-type-eq-decl nil integers nil)
(posnat nonempty-type-eq-decl nil integers nil))
nil))
(walk_acr 0
(walk_acr-1 nil 3301756562
("" (induct "n" 1 "NAT_induction")
(("1" (skosimp*)
(("1" (inst -1 "j!1-1")
(("1" (assert)
(("1" (inst?)
(("1" (assert)
(("1" (split -1)
(("1" (skosimp*)
(("1" (inst 3 "j!2") (("1" (assert) nil nil)) nil))
nil)
("2" (assert)
(("2" (inst 2 "j!1") (("2" (assert) nil nil)) nil))
nil))
nil))
nil))
nil))
nil)
("2" (assert) nil nil))
nil))
nil)
("2" (skosimp*) (("2" (assert) nil nil)) nil)
("3" (skosimp*) (("3" (assert) nil nil)) nil))
nil)
((real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(j!1 skolem-const-decl "nat" subtrees nil)
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props 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)
(T formal-type-decl nil subtrees nil)
(edgetype type-eq-decl nil digraphs nil)
(finite_set type-eq-decl nil finite_sets nil)
(predigraph type-eq-decl nil digraphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(digraph type-eq-decl nil digraphs nil)
(set type-eq-decl nil sets nil)
(nonempty? const-decl "bool" sets nil)
(Digraph type-eq-decl nil digraphs 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)
(walk? const-decl "bool" walks nil)
(Walk type-eq-decl nil walks nil) (< const-decl "bool" reals nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(nonneg_int nonempty-type-eq-decl nil integers nil)
(posnat nonempty-type-eq-decl nil integers nil)
(<= const-decl "bool" reals nil)
(numfield nonempty-type-eq-decl nil number_fields nil)
(- const-decl "[numfield, numfield -> numfield]" number_fields nil)
(int_minus_int_is_int application-judgement "int" integers nil))
nil))
(walk_acr2 0
(walk_acr2-1 nil 3301756562
("" (induct "n" 1 "NAT_induction")
(("1" (skosimp*)
(("1" (inst -1 "j!1-1")
(("1" (assert)
(("1" (inst?)
(("1" (assert)
(("1" (split -1)
(("1" (skosimp*)
(("1" (inst 3 "j!2") (("1" (assert) nil nil)) nil))
nil)
("2" (inst 2 "j!1") (("2" (assert) nil nil)) nil))
nil))
nil))
nil))
nil)
("2" (assert) nil nil))
nil))
nil)
("2" (skosimp*) (("2" (assert) nil nil)) nil)
("3" (skosimp*) (("3" (assert) nil nil)) nil))
nil)
((real_lt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_gt_is_strict_total_order name-judgement
"(strict_total_order?[real])" real_props nil)
(real_le_is_total_order name-judgement "(total_order?[real])"
real_props nil)
(j!1 skolem-const-decl "nat" subtrees nil)
(real_ge_is_total_order name-judgement "(total_order?[real])"
real_props 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)
(T formal-type-decl nil subtrees nil)
(edgetype type-eq-decl nil digraphs nil)
(finite_set type-eq-decl nil finite_sets nil)
(predigraph type-eq-decl nil digraphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(digraph type-eq-decl nil digraphs nil)
(set type-eq-decl nil sets nil)
(nonempty? const-decl "bool" sets nil)
(Digraph type-eq-decl nil digraphs 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)
(walk? const-decl "bool" walks nil)
(Walk type-eq-decl nil walks nil) (< const-decl "bool" reals nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(nonneg_int nonempty-type-eq-decl nil integers nil)
(posnat nonempty-type-eq-decl nil integers nil)
(<= const-decl "bool" reals nil)
(numfield nonempty-type-eq-decl nil number_fields nil)
(- const-decl "[numfield, numfield -> numfield]" number_fields nil)
(int_minus_int_is_int application-judgement "int" integers nil))
nil))
(add_pair 0
(add_pair-1 nil 3301756562
("" (skosimp*)
(("" (expand "add")
(("" (expand "member")
(("" (split -2)
(("1" (replace -1 * rl)
(("1" (hide -1) (("1" (ground) nil nil)) nil)) nil)
("2" (typepred "G!1")
(("2" (inst?)
(("2" (assert)
(("2" (flatten) (("2" (assert) nil nil)) nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil)
((add const-decl "(nonempty?)" sets nil)
(boolean nonempty-type-decl nil booleans nil)
(bool nonempty-type-eq-decl nil booleans nil)
(NOT const-decl "[bool -> bool]" booleans nil)
(T formal-type-decl nil subtrees nil)
(edgetype type-eq-decl nil digraphs nil)
(IMPLIES const-decl "[bool, bool -> bool]" booleans nil)
(finite_set type-eq-decl nil finite_sets nil)
(predigraph type-eq-decl nil digraphs nil)
(AND const-decl "[bool, bool -> bool]" booleans nil)
(digraph type-eq-decl nil digraphs nil)
(set type-eq-decl nil sets nil)
(nonempty? const-decl "bool" sets nil)
(Digraph type-eq-decl nil digraphs nil)
(member const-decl "bool" sets nil))
nil))
(max_tree_all_verts 0
(max_tree_all_verts-3 nil 3560851788
("" (skosimp*)
(("" (decompose-equality)
(("" (iff 1)
(("" (prop)
(("1" (hide -2)
(("1" (expand "max_subtree")
(("1" (typepred "max_di_subgraph(G!1, tree?)")
(("1" (hide -1 -3 -5)
(("1" (expand "di_subgraph?")
(("1" (flatten)
(("1" (hide -2)
(("1" (expand* "subset?" "member")
(("1" (inst -1 "x!1")
(("1" (assert) nil nil)) nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2" (name-replace "TR" "max_subtree(G!1)" :hide? nil)
(("2" (lemma "max_subtree_tree")
(("2" (inst?)
(("2" (replace -2)
(("2" (case "(EXISTS (v: T): vert(TR)(v))")
(("1" (skosimp*)
(("1" (expand* "connected?" "reachable?")
(("1" (inst -5 "v!1" "x!1")
(("1" (assert)
(("1" (skosimp*)
(("1"
(case
"(EXISTS (j: posnat): j < length(w!1) AND vert(TR)(w!1(j-1)) AND
NOT vert(TR)(w!1(j)))")
(("1"
(expand*
"walk_from?"
"walk?"
"from?"
"verts_in?")
(("1"
(flatten)
(("1"
(expand "finseq_appl")
(("1"
(skosimp*)
(("1"
(inst -10 "j!1 - 1")
(("1"
(assert)
(("1"
(name-replace
"ss"
"seq(w!1)(j!1 - 1)"
:hide?
nil)
(("1"
(name-replace
"tt"
"seq(w!1)(j!1)"
:hide?
nil)
(("1"
(name
"TP"
"(# vert := add(tt,vert(TR)),
edges := add((ss,tt),edges(TR)) #)")
(("1"
(case "tree?(TP)")
(("1"
(lemma
"max_subtree_max")
(("1"
(inst
-1
"G!1"
"TP")
(("1"
(replace -10)
(("1"
(replace
-3
-1
rl)
(("1"
(expand
"size")
(("1"
(rewrite
"card_add[T]")
(("1"
(assert)
nil
nil))
nil))
nil))
nil))
nil)
("2"
(assert)
(("2"
(expand
"di_subgraph?")
(("2"
(split)
(("1"
(expand*
"subset?"
"member")
(("1"
(skosimp)
(("1"
(expand
"max_subtree")
(("1"
(typepred
"max_di_subgraph(G!1, tree?)")
(("1"
(hide
-1
-3)
(("1"
(expand
"di_subgraph?")
(("1"
(flatten)
(("1"
(hide
-2)
(("1"
(replace
-11)
(("1"
(case
"vert(TR)(x!2)")
(("1"
(expand
"subset?")
(("1"
(expand
"member")
(("1"
(inst
-2
"x!2")
(("1"
(assert)
nil
nil))
nil))
nil))
nil)
("2"
(case
"x!2 = tt")
(("1"
(inst
-16
"j!1")
(("1"
(assert)
nil
nil))
nil)
("2"
(case
"vert(TP) = add(tt, vert(TR))")
(("1"
(expand
"add"
-1)
(("1"
(decompose-equality
-1)
(("1"
(inst
-1
"x!2")
(("1"
(assert)
(("1"
(expand
"member")
(("1"
(propax)
nil
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(hide-all-but
(-4
1))
(("2"
(expand
"add")
(("2"
(replace
-1
1
rl)
(("2"
(hide
-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)
("2"
(hide-all-but
(-2
-9
-14
1))
(("2"
(expand
"max_subtree")
(("2"
(typepred
"max_di_subgraph(G!1, tree?)")
(("2"
(hide
-1
-3)
(("2"
(expand
"di_subgraph?")
(("2"
(flatten)
(("2"
(hide
-1)
(("2"
(expand*
"subset?"
"member")
(("2"
(skosimp)
(("2"
(replace
-4)
(("2"
(case
"edges(TR)(x!2)")
(("1"
(inst
-2
"x!2")
(("1"
(assert)
nil
nil))
nil)
("2"
(case
"x!2 = (ss, tt)")
(("1"
(expand
"edge?")
(("1"
(assert)
nil
nil))
nil)
("2"
(hide
-1
-5
3)
(("2"
(case
"edges(TP) = add((ss, tt), edges(TR))")
(("1"
(hide
-3)
(("1"
(expand*
"add"
"member")
(("1"
(decompose-equality
-1)
(("1"
(inst
-1
"x!2")
(("1"
(assert)
(("1"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(replace
-2
1
rl)
(("2"
(hide-all-but
1)
(("2"
(expand*
"add"
"member")
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
"tree?"
1)
(("2"
(flatten)
(("2"
(inst 2 "tt")
(("1"
(split)
(("1"
(expand
"leaf?")
(("1"
(split)
(("1"
(expand
"in_deg")
(("1"
(rewrite
"card_one"
1)
(("1"
(inst
1
"(ss, tt)")
(("1"
(decompose-equality
1)
(("1"
(iff)
(("1"
(prop)
(("1"
(expand
"incoming_edges")
(("1"
(flatten)
(("1"
(expand*
"add"
"member")
(("1"
(case
"edges(TP) = {y: edgetype[T] | (ss, tt) = y OR edges(TR)(y)}")
(("1"
(hide
-4)
(("1"
(decompose-equality
-1)
(("1"
(inst
-1
"(x!2, x!3)")
(("1"
(assert)
(("1"
(split)
(("1"
(expand
"singleton")
(("1"
(assert)
nil
nil))
nil)
("2"
(hide-all-but
(-1
-7
-10
3))
(("2"
(expand
"max_subtree")
(("2"
(typepred
"max_di_subgraph(G!1, tree?)")
(("2"
(hide
-2
-3)
(("2"
(inst
-1
"(x!2, x!3)")
(("2"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(replace
-3
1
rl)
(("2"
(hide-all-but
1)
(("2"
(decompose-equality)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(hide-all-but
(-1
-2
1))
(("2"
(expand
"incoming_edges")
(("2"
(expand
"singleton")
(("2"
(flatten)
(("2"
(assert)
(("2"
(replaces
-1)
(("2"
(replaces
-1)
(("2"
(replace
-1
1
rl)
(("2"
(hide
-1)
(("2"
(expand
"add")
(("2"
(propax)
nil
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(expand
"out_deg")
(("2"
(lemma
"empty_card[edgetype[T]]")
(("2"
(inst
-1
"outgoing_edges(tt, TP)")
(("2"
(assert)
(("2"
(expand*
"empty?"
"member")
(("2"
(skosimp)
(("2"
(hide
1)
(("2"
(expand
"outgoing_edges")
(("2"
(flatten)
(("2"
(case
"edges(TR)(x!2)")
(("1"
(expand
"max_subtree")
(("1"
(typepred
"max_di_subgraph(G!1, tree?)")
(("1"
(hide
-2
-3)
(("1"
(replace
-12)
(("1"
(inst
-1
"x!2")
(("1"
(assert)
nil
nil))
nil))
nil))
nil))
nil))
nil)
("2"
(case
"x!2 = (ss, tt)")
(("1"
(decompose-equality
-1)
(("1"
(hide-all-but
(-1
-2
-4
-17
-18))
(("1"
(replaces
-3)
(("1"
(hide
-2)
(("1"
(expand
"no_self_loops?")
(("1"
(inst
-3
"(ss, tt)")
(("1"
(assert)
nil
nil)
("2"
(expand
"edge?")
(("2"
(propax)
nil
--> --------------------
--> maximum size reached
--> --------------------
¤ Dauer der Verarbeitung: 0.37 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.
|