The TPTP Problem Library and Associated Infrastructure

Authors:
Geoff Sutcliffe
Affiliations:
Department of Computer Science, University of Miami, Coral Gables, USA 33124
Venue:
Journal of Automated Reasoning
Year:
2009

Citing 37
Cited 60

Seventy-five problems for testing automatic theorem provers

Journal of Automated Reasoning
Set theory in first-order logic: clauses for Go¨del's axioms

Journal of Automated Reasoning
Non-horn clause logic programming without contrapositives

Journal of Automated Reasoning
Automated deduction in von Neumann-Bernays-Go¨del set theory

Journal of Automated Reasoning
Ivy: a preprocessor and proof checker for first-order logic

Computer-Aided reasoning
Evaluating general purpose automated theorem proving systems

Artificial Intelligence
Gandalf

Journal of Automated Reasoning
The TPTP Problem Library

Journal of Automated Reasoning
The IJCAR ATP System Competition

Journal of Automated Reasoning
Smart Selective Competition Parallelism ATP

Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Learning Search Control Knowledge for Equational Theorem Proving

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Proof Development with OMEGA

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Experiments in Automated Deduction with Condensed Detachment

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
System Description: SystemOn TPTP

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Octopus: Combining Learning and Parallel Search

Journal of Automated Reasoning
The state of CASC

AI Communications
OMDoc -- An Open Markup Format for Mathematical Documents [version 1.2]: Foreword by Alan Bundy (Lecture Notes in Computer Science)

OMDoc -- An Open Markup Format for Mathematical Documents [version 1.2]: Foreword by Alan Bundy (Lecture Notes in Computer Science)
Automation for interactive proof: first prototype

Information and Computation - Special issue: Combining logical systems
MPTP 0.2: Design, Implementation, and Initial Experiments

Journal of Automated Reasoning
The impact of CASC in the development of automated deduction systems: Guest-editorial

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
A phytography of WALDMEISTER

AI Communications - CASC
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
Yago: a core of semantic knowledge

Proceedings of the 16th international conference on World Wide Web
An Interactive Derivation Viewer

Electronic Notes in Theoretical Computer Science (ENTCS)
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
The CADE-21 automated theorem proving system competition

AI Communications
Combining multiple heuristics online

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
The first answer set programming system competition

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Zenon: an extensible automated theorem prover producing checkable proofs

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
External sources of axioms in automated theorem proving

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Using the TPTP language for writing derivations and finite interpretations

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Extending the TPTP language to higher-order logic with automated parser generation

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
SMT-COMP: satisfiability modulo theories competition

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
TPTP, TSTP, CASC, etc.

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
The CADE-22 automated theorem proving system competition - CASC-22

AI Communications
Heuristics for resolution in propositional logic

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
A benchmark- and competition-based approach to software engineering research

Proceedings of the FSE/SDP workshop on Future of software engineering research
Combining logics in simple type theory

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Automated reasoning and presentation support for formalizing mathematics in Mizar

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
The 5th IJCAR automated theorem proving system competition - CASC-J5

AI Communications
The TPTP world - infrastructure for automated reasoning

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Disunification for ultimately periodic interpretations

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Automated proof compression by invention of new definitions

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Specifying and verifying organizational security properties in first-order logic

Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Specifying and verifying organizational security properties in first-order logic

Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Building structured theories

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Experimenting with deduction modulo

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Heaps and data structures: a challenge for automated provers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Sine Qua non for large theory reasoning

CADE'11 Proceedings of the 23rd international conference on Automated deduction
System description: SPASS-FD

CADE'11 Proceedings of the 23rd international conference on Automated deduction
On transfinite Knuth-Bendix orders

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Reasoning in the OWL 2 full ontology language using first-order automated theorem proving

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automated Inference of Finite Unsatisfiability

Journal of Automated Reasoning
Playing in the grey area of proofs

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Invariant and type inference for matrices

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Higher-order aspects and context in SUMO

Web Semantics: Science, Services and Agents on the World Wide Web
Interpolation and symbol elimination in vampire

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Premise selection in the naproche system

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Termination tools in ordered completion

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Thousands of geometric problems for geometric theorem provers (TGTP)

ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
A coherent logic based geometry theorem prover capable of producing formal and readable proofs

ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
Incremental variable splitting

Journal of Symbolic Computation
The TPTP typed first-order form with arithmetic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Ordinals and knuth-bendix orders

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Combining interactive and automatic reasoning in first order theories of functional programs

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
The CADE-23 Automated Theorem Proving System Competition - CASC-23

AI Communications
Project presentation: algorithmic structuring and compression of proofs (ASCOP)

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Truthful monadic abstractions

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Satallax: an automatic higher-order prover

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The QMLTP problem library for first-order modal logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Fingerprint indexing for paramodulation and rewriting

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Typeful ontologies with direct multilingual verbalization

CNL'10 Proceedings of the Second international conference on Controlled Natural Language
Dependently typed programming based on automated theorem proving

MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Embedding and automating conditional logics in classical higher-order logic

Annals of Mathematics and Artificial Intelligence
HALO: haskell to logic through denotational semantics

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic backward reachability with effectively propositional logic

Formal Methods in System Design
A framework for testing first-order logic axioms in program verification

Software Quality Control
Hierarchic superposition with weak abstraction

CADE'13 Proceedings of the 24th international conference on Automated Deduction
System description: E-KRHyper 1.4: extensions for unique names and description logic

CADE'13 Proceedings of the 24th international conference on Automated Deduction
E-MaLeS 1.1

CADE'13 Proceedings of the 24th international conference on Automated Deduction
TFF1: the TPTP typed first-order form with rank-1 polymorphism

CADE'13 Proceedings of the 24th international conference on Automated Deduction
The 481 ways to split a clause and deal with propositional variables

CADE'13 Proceedings of the 24th international conference on Automated Deduction
First-Order theorem proving and vampire

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A qualitative comparison of the suitability of four theorem provers for basic auction theory

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Automating quantified conditional logics in HOL

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
(Dual) hoops have unique halving

Automated Reasoning and Mathematics
Toward a procedure for data mining proofs

Automated Reasoning and Mathematics
The 6th IJCAR automated theorem proving system competition --CASC-J6

AI Communications
Sigma: An integrated development environment for formal ontology

AI Communications - Intelligent Engineering Techniques for Knowledge Bases
Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations

Journal of Computer Security - Foundational Aspects of Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the TPTP problem library, and the associated infrastructure. TPTP v3.5.0 was the last release containing only FOF and CNF problems, and thus serves as the exemplar. This paper summarizes the history and development of the TPTP, describes the structure and contents of the TPTP, and gives an overview of TPTP related projects and tools.