TPTP

E900629

TPTP is a widely used library and standard collection of test problems for automated theorem proving and related logic-based tools.

Try in SPARQL Jump to: Statements Referenced by

Statements (50)

Predicate Object
instanceOf benchmark suite
problem library
software engineering artifact
standard
acronymFor Thousands of Problems for Theorem Provers NERFINISHED
associatedWith CADE ATP System Competition NERFINISHED
CASC NERFINISHED
contains axiom sets
conjectures
logic problems
model finding problems
satisfiability problems
satisfiable problems
theorem proving problems
unsatisfiable problems
domain automated reasoning
automated theorem proving
mathematical logic
fullName Thousands of Problems for Theorem Provers NERFINISHED
goal provide reusable benchmarks for automated reasoning
standardize test problems for theorem provers
support fair comparison of theorem provers
hasCitation G. Sutcliffe, "The TPTP Problem Library and Associated Infrastructure", Journal of Automated Reasoning NERFINISHED
hasComponent TPTP language NERFINISHED
TPTP problem library NERFINISHED
TSTP proof library NERFINISHED
infrastructure tools
hasFormat TPTP CNF format NERFINISHED
TPTP FOF format NERFINISHED
TPTP TFF format
TPTP THF format NERFINISHED
TPTP syntax
hasWebsite http://www.tptp.org/
maintainedBy Geoff Sutcliffe NERFINISHED
supportsLogic first-order logic
higher-order logic
propositional logic
typed first-order logic
typicalUser automated reasoning researcher
logic tool developer
theorem prover developer
usedFor benchmarking automated theorem provers
comparative experiments of theorem provers
development of proof systems
evaluation of logic-based tools
regression testing of theorem provers
testing automated theorem provers
usedIn CADE conferences NERFINISHED
IJCAR conferences
automated reasoning competitions

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.