(subgraphsnil 3251040622"" (skosimp*)"" (lemma "finite_subset[T]" )"" (inst?)"" (inst -1 "vert(G!1)" )"" (assert ) (("" (hide 2) (("" (grind) nil nil )) nil ))nil ))nil ))nil ))nil ))nil )nil subgraphs nil )nil finite_sets nil )"bool" finite_sets nil )"bool" sets nil )"bool" sets nil )"(partial_order?[set[T]])" nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil )nil finite_sets nil )nil doubletons nil )"set[T]" doubletons nil )"[T, T -> boolean]" equalities nil )"boolean" notequal nil )AND const-decl "[bool, bool -> bool]" booleans nil )set type-eq-decl nil sets nil )nil booleans nil )nil booleans nil ))nil ))nil 3251040622"" (skosimp*)"" (lemma "finite_subset[doubleton[T]]" )"" (inst?)"" (assert )"" (inst - "edges(G!1)" )"" (assert ) (("" (hide 2) (("" (grind) nil nil )) nil ))nil ))nil ))nil ))nil ))nil ))nil )nil doubletons nil )"set[T]" doubletons nil )"[T, T -> boolean]" equalities nil )"boolean" notequal nil )AND const-decl "[bool, bool -> bool]" booleans nil )set type-eq-decl nil sets nil )nil booleans nil )nil booleans nil )nil subgraphs nil )nil finite_sets nil )"(partial_order?[set[T]])" nil )"bool" sets nil )"bool" sets nil )NOT const-decl "[bool -> bool]" booleans nil )"bool" finite_sets nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil )nil finite_sets nil ))nil ))nil 3307708398"" (skosimp*)"" (lemma "finite_vert_subset" ) (("" (inst?) nil nil )) nil )) nil )nil subgraphs nil )nil subgraphs nil )nil booleans nil )nil booleans nil )set type-eq-decl nil sets nil )AND const-decl "[bool, bool -> bool]" booleans nil )"boolean" notequal nil )"[T, T -> boolean]" equalities nil )"set[T]" doubletons nil )nil doubletons nil )nil finite_sets nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil ))nil ))nil 3307713815"" (skosimp*)"" (split +)"1" (skosimp*)"1" (typepred "G!1" )"1" (inst?)"1" (assert )"1" (inst?)"1" (inst?) (("1" (assert ) nil nil )) nil )) nil ))nil ))nil ))nil ))nil )"2" (grind) nil nil ))nil ))nil )nil graphs nil )nil graphs nil )nil finite_sets nil )"[bool, bool -> bool]" booleans nil )nil doubletons nil )"set[T]" doubletons nil )"[T, T -> boolean]" equalities nil )"boolean" notequal nil )AND const-decl "[bool, bool -> bool]" booleans nil )set type-eq-decl nil sets nil )nil subgraphs nil )NOT const-decl "[bool -> bool]" booleans nil )nil booleans nil )nil booleans nil )"bool" sets nil )"bool" sets nil )"bool" subgraphs nil )"(partial_order?[set[T]])" nil ))nil )nil 3307708398 ("" (subtype-tcc) nil nil ) nil nil ))nil 3251040622"" (skosimp*)"" (expand "subgraph" )"" (apply-extensionality 1 :hide? t)"" (expand "subset?" )"" (inst?)"" (expand "member" )"" (iff 1) (("" (ground) nil nil )) nil )) nil ))nil ))nil ))nil ))nil ))nil )"Subgraph(G)" subgraphs nil )"bool" sets nil )"bool" sets nil )"(partial_order?[set[T]])" nil )nil booleans nil )AND const-decl "[bool, bool -> bool]" booleans nil )set type-eq-decl nil sets nil )"boolean" notequal nil )"[T, T -> boolean]" equalities nil )"set[T]" doubletons nil )nil doubletons nil )nil finite_sets nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil )nil booleans nil )nil subgraphs nil ))nil ))nil 3251040622"" (skosimp*) (("" (assert ) nil nil )) nil ) nil nil ))nil 3251040622"" (skosimp*)"" (expand "size" )"" (expand "subgraph?" )"" (rewrite "card_subset[T]" ) nil nil )) nil ))nil ))nil )"nat" graphs nil )"(total_order?[real])" nil )"(partial_order?[set[T]])" 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 )AND const-decl "[bool, bool -> bool]" booleans nil )"boolean" notequal nil )"[T, T -> boolean]" equalities nil )"set[T]" doubletons nil )nil doubletons nil )nil graphs nil )"[bool, bool -> bool]" booleans nil )nil graphs nil )nil subgraphs nil )"bool" subgraphs nil ))nil )))quality 100%
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
