The TPTP Problem Library for Automated Theorem Proving by Geoff Sutcliffe and Christian Suttner

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:

• A comprehensive library of the ATP test problems that are available today, in order to provide an overview and a simple, unambiguous reference mechanism.
• A comprehensive list of references and other interesting information for each problem.
• Arbitrary size instances of generic problems (e.g., the N-queens problem).
• A utility to convert the problems to existing ATP systems' formats.
• General guidelines outlining the requirements for ATP system evaluation.
• Standards for input and output for ATP systems.

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.

    @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"
    } 

    @Article{Sut22,
        Author       = "Sutcliffe, G.",
        Year         = "2022",
        Title        = "{The Logic Languages of the TPTP World}",
        Journal      = "Logic Journal of the IGPL",
        DOI          = "10.1093/jigpal/jzac068"
    }