The TPTP Problem Library
for Automated Theorem Proving

by Geoff Sutcliffe
geoff@cs.miami.edu
 and Christian Suttner
christian@suttner.info

The TPTP (Thousands of Problems for Theorem Provers) is a library of test problems for automated theorem proving (ATP) systems. The TPTP supplies the ATP community with:

The principal motivation for the TPTP is to support the testing and evaluation of ATP systems, to help ensure that performance results accurately reflect capabilities of the ATP systems being considered. A common library of problems is necessary for meaningful system evaluations, meaningful system comparisons, repeatability of testing, and the production of statistically significant results. The TPTP is such a library.

If you're new to all this, you might want to start at the TPTP and TSTP Quick Guide.
You could also work your way through the slides of the TPTP World Tutorial.

The TPTP Needs Money  
 Recent donors ...   20/05/19 - Yi Gao, Tableau    13/05/19 - Landon Fuller    07/01/19 - Jesse Alama    03/12/18 - Pascal Fontaine, Université de Lorraine    13/09/18 - Anonymous    14/07/18 - Laura Kovacs, TU Wien    30/06/18 - Bruno Woltzenlogel Paleo, AOSSIE    31/05/18 - Mark Wallace, Monash University    Today - You (seriously ... do it!) 		If your work benefits from use of the TPTP and related projects, consider making an annual cash donation of 100 units of a reasonable currency, to support the TPTP. A donation can be made as an unrestricted gift (tax deductable) to the University of Miami, explicitly to support the TPTP and related projects. Read about the benefits and process of making a donation. You can donate right now, online with a credit card. A premium support contract is also available.
The current release of the TPTP Library is TPTP-v7.2.0 (Tue Jul 10 11:20:43 EDT 2018)
Download package, 579MB, expands to 6.6GB. (Contains the problems, axiom sets, documents, and utilities.)
This release provides an introduction to the extended TFF syntax. Sample problems using the syntax are available here.
Online access to:
Basic information.
Individual problems.
Individual axiom sets.
All the TPTP documents
History of changes to the TPTP and the archive of previous versions.
Online access to the tptp2T utility.

Current information, available only online:
Bugged problems list (Bugs found in the current version)
Details about the TPTP. Read this whenever you have a question about the TPTP.
The very latest hyperlinked BNF for the TPTP language.

If you would like to cite the TPTP, please use: 

  • @Article{Sut17,
    Author       = "Sutcliffe, G.",
    Year         = "2017",
    Title        = "{The TPTP Problem Library and Associated Infrastructure.
                    From CNF to TH0, TPTP v6.4.0}",
    Journal      = "Journal of Automated Reasoning",
    Volume       = "59",
    Number       = "4",
    Pages        = "483-502"
}

TPTP subprojects:
Services for solving problems and recommending systems.
The TSTP (Thousands of Solutions from Theorem Provers) Solution Library is a library of solutions to test problems for automated theorem proving (ATP) systems. In particular, it contains solutions to TPTP problems.
The TMTP (Thousands of Models for Theorem Provers) Model Library is a library of models of axiomatizations for automated theorem proving (ATP) systems. In particular, it contains models for TPTP axiomatizations.
The TPTP is used to supply problems for the CADE ATP System Competition.
  • TPTP Proposals
We are working on new features for the TPTP, as explained in the following proposals. Comments from potential users will be appreciated.
  • External Projects
  • TPTP Software
Many people have written software for processing TPTP format data. These links point to software I know of (please send your link if you have some software to add to the list).
  • Geoff's Service Tools. A bunch of tools for manipulating the TPTP, including the JJ parser for the TPTP language (named after the Spanish software developers, Justo Fernandez Reche and José Taboada Berenguer). The JJ parser will parse TPTP files and build a useful data structure, and there are lots of "useful" API functions for interrogating and manipulating the data structure. There is no documentation for any of this yet, but the sample drivers illustrate how to use the JJ parser API.
  • Tobias Gleißner's ANTLR4 grammar for the SyntaxBNF-v7.0.0.
  • Guy Shefner's Java class library for parsing, structuring, and basic manipulation of problems in first order logic.
  • Matthias Fuchs' NPM package for the TPTP and SystemOnTPTP.
  • Mark Lemay's Xtext based Java parser for the TPTP grammar.
This approximately-annual meeting is used to to discuss the TPTP and related issues.

Other people are doing similar things for other types of ATP problems:
Benchmark verification tasks in software verification, as used in SV-COMP.
This website features a series of notebooks presenting some of Larry Wos’s most recent and hitherto unpublished research in automated reasoning (also in 1st order logic).
The major goal of SMT-LIB is to establish a library of benchmarks for Satisfiability Modulo Theories, that is, satisfiability of formulas with respect to background theories for which specialized decision procedures exist.
The Quantified Modal Logics Theorem Proving (QMLTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for first-order modal logics.
The Dozens of Problems for Partial Deduction (DPPD) Library of Benchmarks aims at being a standard suite of benchmarks for partial deduction.
An environment for submitting and archiving benchmarking Answer-Set Programming (ASP) problems and instances, in which ASP systems can be run under equal and reproducible conditions, leading to independent results.
The Intuitionistic Logic Theorem Proving (ILTP) library provides a platform for testing and benchmarking automated theorem proving (ATP) systems for first-order and propositional intuitionistic logic.
The Termination Problems Database is a library of test problems for termination provers. Currently, it includes termination problems for term rewrite systems and logic programs.
A benchmark library of problems for the constraints community. The main motivation for CSPLib is to focus research in constraints away from purely random problems and onto more structured problems.
A collection of test data sets for a variety of Operations Research (OR) problems.
The Project Scheduling Problem Library.
The graph matching library, developed mainly to test the VF graph matching algorithm, and to compare it with other known algorithms.
A collection of induction challenge problems.
A collection of benchmark problems, solvers, and tools for SAT related research.
Experiments and execution traces of SAT solvers, on all benchmarks that are provided.
QBFLIB is a collection of benchmark problems, solvers, and tools related to Quantified Boolean Formula (QBF) satisfiability.

There were 682 unique visitors to the James Cook University site, 1 January 2001 to 21 March 2001. Then the site moved to the University of Miami. Unique visitors to the University of Miami site since 21 March 2001: