final case class AtomicTerm(f: String, args: Seq[Term]) extends Term with Product with Serializable
f
may be a dollar word, a dollar dollar word (plain string starting with $ or $$),
a lower word (plain string with certain restrictions) or a single quoted TPTP atomic word. In the latter case,
non-lower word atomic words are enclosed in single quotes, e.g. '...'.
Any string that is neither a dollar/dollardollar word, a lower word, or a single quoted, is an invalid
value for f
. Use
TPTP.isLowerWord
to check if the string a valid (non-quoted) value for f
, or
transform via
TPTP.convertStringToAtomicWord
if necessary before.
- See also
- Alphabetic
- By Inheritance
- AtomicTerm
- Serializable
- Product
- Equals
- Term
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val args: Seq[Term]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val f: String
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def isConstant: Boolean
- Annotations
- @inline()
- def isDefinedFunction: Boolean
- Annotations
- @inline()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isSystemFunction: Boolean
- Annotations
- @inline()
- def isUninterpretedFunction: Boolean
- Annotations
- @inline()
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def pretty: String
Returns a TPTP-compliant serialization of the term.
Returns a TPTP-compliant serialization of the term.
- Definition Classes
- AtomicTerm → Term
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def symbols: Set[String]
Returns a set of symbols (except variables) occurring in the term.
Returns a set of symbols (except variables) occurring in the term.
- Definition Classes
- AtomicTerm → Term
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
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:
Exemplary use case