Packages

•  package root

  This is the documentation for the Scala TPTP parser used, e.g., by the Leo-III prover.

  This is the documentation for the Scala TPTP parser used, e.g., by the Leo-III prover.

  Package structure

  The leo package contains two sub-packages as follows:

  • leo.datastructures contains the leo.datastructures.TPTP object that bundles the different abstract syntax tree (AST) representations for the different TPTP language dialects, including ...
    • leo.datastructures.TPTP.THF - Higher-order formulas (THF)
    • leo.datastructures.TPTP.TFF - Typed first-order formulas (TFF)
    • leo.datastructures.TPTP.FOF - Untyped first-order formulas (FOF)
    • leo.datastructures.TPTP.TCF - Typed clausal form (TCF)
    • leo.datastructures.TPTP.CNF - Untyped clausal form (CNF)
  • leo.modules.input - the parser itself.

  Usage (in short)

  The leo.modules.input.TPTPParser offers several parsing methods:

  • leo.modules.input.TPTPParser.problem - for a whole TPTP problem
  • leo.modules.input.TPTPParser.annotated - for an annotated TPTP formula (specialized methods for the individual dialects exist).
  • leo.modules.input.TPTPParser.thf - for a plain THF formula (without annotations)
  • leo.modules.input.TPTPParser.tff - for a plain TFF formula (without annotations)
  • ... etc.

  Exemplary use case

  import leo.modules.input.{TPTPParser => Parser}
  import TPTPParser.TPTPParseException
  import leo.datastructures.TPTP.THF
  
  try {
   val result = Parser.problem(io.Source.fromFile("/path/to/file"))
   println(s"Parsed ${result.formulas.size} formulae and ${result.includes.size} include statements.")
   // ...
   val annotatedFormula = Parser.annotatedTHF("thf(f, axiom, ![X:$i]: (p @ X)).")
   println(s"${annotatedFormula.name} is an ${annotatedFormula.role}.")
   // ...
   val formula = Parser.thf("![X:$i]: (p @ X)")
   formula match {
     case THF.FunctionTerm(f, args) => // ...
     case THF.QuantifiedFormula(quantifier, variableList, body) => // ...
     case THF.Variable(name) => // ...
     case THF.UnaryFormula(connective, body) => // ...
     case THF.BinaryFormula(connective, left, right) => // ...
     case THF.Tuple(elements) => // ...
     case THF.ConditionalTerm(condition, thn, els) => // ...
     case THF.LetTerm(typing, binding, body) => // ...
     case THF.DefinedTH1ConstantTerm(constant) => // ...
     case THF.ConnectiveTerm(conn) => // ...
     case THF.DistinctObject(name) => // ...
     case THF.NumberTerm(value) => // ...
   }
   // ...
  } catch {
   case e: TPTPParseException => println(s"Parse error at line ${e.line}:${e.offset}: ${e.getMessage}")
  }

  Definition Classes

  root

•  package leo

  Definition Classes

  root

•  package datastructures

  Definition Classes

  leo

•  object TPTP

  Collection of TPTP-related data types that are returned by the leo.modules.input.TPTPParser.

  Collection of TPTP-related data types that are returned by the leo.modules.input.TPTPParser. An overview:

  • Whole TPTP problem files are represented by leo.datastructures.TPTP.Problem,
  • Annotated formulas are represented by leo.datastructures.TPTP.AnnotatedFormulas, more specifically ...
    • Annotated THF formulas by leo.datastructures.TPTP.THFAnnotated,
    • Annotated TFF formulas by leo.datastructures.TPTP.TFFAnnotated,
    • Annotated FOF formulas by leo.datastructures.TPTP.FOFAnnotated,
    • Annotated TCF formulas by leo.datastructures.TPTP.TCFAnnotated,
    • Annotated CNF formulas by leo.datastructures.TPTP.CNFAnnotated, and
    • Annotated TPI formulas by leo.datastructures.TPTP.TPIAnnotated
  • Include directives are represented by tuples (filename,(optional-list-of-ids,comments)) of type leo.datastructures.TPTP.Include.

  See TPTP.THF, TPTP.TFF, TPTP.FOF, TPTP.TCF, TPTP.CNF for more information on the representation of "plain" THF, TFF, FOF, TCF and CNF formulas, respectively.

  All classes have a function called pretty that will output the TPTP-compliant representation of the respective structure. It should hold that parse(x.pretty) = x where parse is the hypothetical parsing function for that structure.

  Definition Classes

  datastructures

•  object THF

  Contains the THF AST data types.

  Contains the THF AST data types.

  Definition Classes

  TPTP

• !
• !!
• !>
• &
• :=
• <=
• <=>
• <~>
• ==
• ?
• ?*
• ??
• @+
• @-
• @=
• @@+
• @@-
• App
• BinaryConnective
• BinaryFormula
• ConditionalTerm
• Connective
• ConnectiveTerm
• DefinedTH1Constant
• DefinedTH1ConstantTerm
• DistinctObject
• Eq
• Formula
• FunTyConstructor
• FunctionTerm
• Impl
• LetTerm
• Logical
• Neq
• NonclassicalBox
• NonclassicalCone
• NonclassicalDiamond
• NonclassicalLongOperator
• NonclassicalPolyaryFormula
• NumberTerm
• ProductTyConstructor
• QuantifiedFormula
• Quantifier
• Sequent
• Statement
• SumTyConstructor
• Tuple
• Typing
• UnaryConnective
• UnaryFormula
• VararyNonclassicalOperator
• Variable
• ^
• |
• ~
• ~&
• ~|

leo.datastructures.TPTP.THF

NonclassicalPolyaryFormula