Quellcode-Bibliothek

^© Kompilation durch diese Firma

[Weder Korrektheit noch Funktionsfähigkeit der Software werden zugesichert.]

Datei: chain.prf Sprache: Lisp

Original von: PVS^©

(chain
(chain_TCC1 0
  (chain_TCC1-1 nil 3314726953 ("" (subtype-tcc) nil nil)
   ((emptyset const-decl "set" sets nil)
    (set type-eq-decl nil sets nil) (T formal-type-decl nil chain nil)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (bool nonempty-type-eq-decl nil booleans nil)
    (boolean nonempty-type-decl nil booleans nil)
    (chain? const-decl "bool" chain nil)
    (total_order? const-decl "bool" orders nil)
    (dichotomous? const-decl "bool" orders nil)
    (restrict const-decl "R" restrict nil)
    (finite_emptyset name-judgement "finite_set" finite_sets nil)
    (partial_order_restrict application-judgement "(partial_order?[S])"
     restrict_order_props nil)
    (preorder_restrict application-judgement "(preorder?[S])"
     restrict_order_props nil)
    (transitive_restrict application-judgement "(transitive?[S])"
     restrict_order_props nil)
    (antisymmetric_restrict application-judgement "(antisymmetric?[S])"
     restrict_order_props nil)
    (reflexive_restrict application-judgement "(reflexive?[S])"
     restrict_order_props nil))
   nil))
(subset_chain 0
  (subset_chain-1 nil 3314726982 ("" (grind) nil nil)
   ((chain nonempty-type-eq-decl nil chain nil)
    (set type-eq-decl nil sets nil) (T formal-type-decl nil chain nil)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (bool nonempty-type-eq-decl nil booleans nil)
    (boolean nonempty-type-decl nil booleans nil)
    (ch!1 skolem-const-decl "chain" chain nil)
    (S!1 skolem-const-decl "set[T]" chain nil)
    (x!1 skolem-const-decl "(S!1)" chain nil)
    (y!1 skolem-const-decl "(S!1)" chain nil)
    (member const-decl "bool" sets nil)
    (subset? const-decl "bool" sets nil)
    (restrict const-decl "R" restrict nil)
    (dichotomous? const-decl "bool" orders nil)
    (total_order? const-decl "bool" orders nil)
    (chain? const-decl "bool" chain nil)
    (partial_order_restrict application-judgement "(partial_order?[S])"
     restrict_order_props nil)
    (preorder_restrict application-judgement "(preorder?[S])"
     restrict_order_props nil)
    (transitive_restrict application-judgement "(transitive?[S])"
     restrict_order_props nil)
    (antisymmetric_restrict application-judgement "(antisymmetric?[S])"
     restrict_order_props nil)
    (reflexive_restrict application-judgement "(reflexive?[S])"
     restrict_order_props nil))
   shostak))
(intersection_chain 0
  (intersection_chain-1 nil 3314726953 ("" (judgement-tcc) nil nil)
   ((chain nonempty-type-eq-decl nil chain nil)
    (set type-eq-decl nil sets nil) (T formal-type-decl nil chain nil)
    (NOT const-decl "[bool -> bool]" booleans nil)
    (bool nonempty-type-eq-decl nil booleans nil)
    (boolean nonempty-type-decl nil booleans nil)
    (intersection const-decl "set" sets nil)
    (member const-decl "bool" sets nil)
    (ch1!1 skolem-const-decl "chain" chain nil)
    (ch2!1 skolem-const-decl "chain" chain nil)
    (x!1 skolem-const-decl "(intersection[T](ch1!1, ch2!1))" chain nil)
    (y!1 skolem-const-decl "(intersection[T](ch1!1, ch2!1))" chain nil)
    (chain? const-decl "bool" chain nil)
    (total_order? const-decl "bool" orders nil)
    (dichotomous? const-decl "bool" orders nil)
    (restrict const-decl "R" restrict nil)
    (partial_order_restrict application-judgement "(partial_order?[S])"
     restrict_order_props nil)
    (preorder_restrict application-judgement "(preorder?[S])"
     restrict_order_props nil)
    (transitive_restrict application-judgement "(transitive?[S])"
     restrict_order_props nil)
    (antisymmetric_restrict application-judgement "(antisymmetric?[S])"
     restrict_order_props nil)
    (reflexive_restrict application-judgement "(reflexive?[S])"
     restrict_order_props nil))
   nil))
(chain_order_partial 0
  (chain_order_partial-1 nil 3314726953 ("" (grind-with-ext) nil nil)
   ((reflexive_restrict application-judgement "(reflexive?[S])"
     restrict_order_props nil)
    (antisymmetric_restrict application-judgement "(antisymmetric?[S])"
     restrict_order_props nil)
    (transitive_restrict application-judgement "(transitive?[S])"
     restrict_order_props nil)
    (preorder_restrict application-judgement "(preorder?[S])"
     restrict_order_props nil)
    (partial_order_restrict application-judgement "(partial_order?[S])"
     restrict_order_props nil)
    (restrict const-decl "R" restrict nil)
    (dichotomous? const-decl "bool" orders nil)
    (total_order? const-decl "bool" orders nil)
    (x!1 skolem-const-decl "chain" chain nil)
    (x!2 skolem-const-decl "T" chain 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 chain nil) (set type-eq-decl nil sets nil)
    (chain? const-decl "bool" chain nil)
    (chain nonempty-type-eq-decl nil chain nil)
    (x!2 skolem-const-decl "T" chain nil)
    (y!1 skolem-const-decl "chain" chain nil)
    (member const-decl "bool" sets nil)
    (subset? const-decl "bool" sets nil)
    (chain_order const-decl "bool" chain nil)
    (reflexive? const-decl "bool" relations nil)
    (transitive? const-decl "bool" relations nil)
    (preorder? const-decl "bool" orders nil)
    (antisymmetric? const-decl "bool" relations nil)
    (partial_order? const-decl "bool" orders nil))
   nil)))

¤ Dauer der Verarbeitung: 0.25 Sekunden (vorverarbeitet) ¤

Download des Quellennavigators
Download des sprechenden Kalenders
in der Quellcodebibliothek suchen

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.