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.

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.

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.

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.

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.

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.

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: