(treesnil 3300198183"" (skosimp*)"" (expand "size" )"" (expand "del_vert" )"" (rewrite "card_remove" ) (("" (assert ) nil nil )) nil ))nil ))nil ))nil )"nat" digraphs nil )nil finite_sets nil )nil booleans nil )nil booleans nil )set type-eq-decl nil sets nil )"bool" finite_sets nil )nil finite_sets nil )nil digraphs nil )nil digraphs nil )"[bool, bool -> bool]" booleans nil )AND const-decl "[bool, bool -> bool]" booleans nil )nil digraphs nil )nil trees nil )"int" integers nil )"(strict_total_order?[real])" real_props nil )"digraph[T]" digraph_ops nil ))"" 3300809694"" (skosimp*)"" (expand "empty?" )"" (use "card_empty?[T]" )"" (iff)"" (assert )"" (expand "tree?" )"" (skosimp*)"" (expand "root?" )"" (lemma "deg_1_sing" )"" (inst?)"" (inst - "v!1" )"" (assert )"" (expand "in?" )"" (expand "empty?" )"" "" expand "member" )"" (propax) nil nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )"bool" digraphs nil )"bool" trees nil )nil digraph_deg nil )"bool" pairs nil )"bool" sets nil )"bool" sets nil )nil booleans nil )nil booleans nil )set type-eq-decl nil sets nil )"bool" finite_sets nil )nil finite_sets nil )nil digraphs nil )nil digraphs nil )"[bool, bool -> bool]" booleans nil )AND const-decl "[bool, bool -> bool]" booleans nil )nil digraphs nil )nil trees nil )nil finite_sets nil ))"" 3300462180"" (skosimp*)"" (expand "empty?" )"" (use "card_empty?[T]" )"" (iff)"" (assert )"" (expand "tree?" )"" (split)"1" (flatten)"1" (use "nonempty_singleton[T]" )"1" (assert )"1" (expand "nonempty?" )"1" (propax) nil nil )) nil ))nil ))nil ))nil )"2" (skosimp*)"2" (expand "tree?" )"2" (split)"1" (flatten)"1" (use "nonempty_singleton[T]" )"1" (assert )"1" (expand "nonempty?" )"1" expand "del_vert" )"1" expand "remove" )"1" expand "member" )"1" "nonempty_singleton[T]" )"1" assert )"1" expand "nonempty?" )"1" expand "empty?" )"1" "1" "1" expand "member" )"1" nil nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )"2" (expand "empty?" )"2" (skosimp*)"2" (inst?)"2" (expand "member" )"2" (postpone) nil nil )) nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )"bool" digraphs nil )nil digraph_deg nil )"bool" pairs nil )nil digraphs nil )nil digraphs nil )nil digraphs nil ))"" 3300130046"" (induct "G" 1 "tree?_induction[T]" )"" (skosimp*)"" (split)"1" (flatten)"1" (assert )"1" (expand "empty?" )"1" (expand "singleton?" )"1" (skosimp* t)"1" (expand "empty?" )"1" (expand "member" )"1" (inst?) (("1" (inst?) nil nil )) nil )) nil ))nil ))nil ))nil ))nil ))nil ))nil )"2" (skosimp*)"2" (assert )"2" (expand "empty?" )"2" (expand "empty?" )"2" (expand "member" )"2" (skosimp*)"2" (inst - "x!1" )"2" (expand "del_vert" )"2" (expand "remove" )"2" (expand "member" )"2" (flatten) nil nil )) nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )nil digraphs nil )nil digraphs nil )nil digraphs nil )"bool" pairs nil )nil digraph_deg nil )"bool" digraphs nil ))nil 3300116030"" (skosimp*)"" (expand "empty?" )"" (use "card_empty?[T]" )"" (iff)"" (assert )"" (expand "tree?" )"" (skosimp*)"" (lemma "deg_1_sing" )"" (inst?)"" (inst - "v!1" )"" (assert )"" (expand "in?" )"" (expand "empty?" )"" (inst?)"" expand "member" )"" (propax) nil nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )"digraph[T]" digraph_ops nil )"bool" digraphs nil )nil digraphs nil )nil digraphs nil )nil digraphs nil ))nil )))quality 100%
¤ Dauer der Verarbeitung: 0.17 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
