TPTP (Thousands of Problems for Theorem Provers) is a freely available collection of problems for automated theorem proving. It is used to evaluate the efficacy of automated reasoning algorithms. Problems are expressed in a simple text-based format for first order logic or higher-order logic. TPTP is used as the source of some problems in CASC.
External links
References
"The TPTP Problem Library for Automated Theorem Proving". http://www.tptp.org/ ↩
Hoder, Kryštof; Voronkov, Andrei (2009). "Comparing Unification Algorithms in First-Order Theorem Proving". KI 2009: Advances in Artificial Intelligence. Lecture Notes in Computer Science. Vol. 5803. pp. 435–443. CiteSeerX 10.1.1.329.1809. doi:10.1007/978-3-642-04617-9_55. ISBN 978-3-642-04616-2. 978-3-642-04616-2 ↩
Hurd, Joe (September 2003). "First-Order Proof Tactics in Higher-Order Logic Theorem Provers". In Archer, Myla; De Vito, Ben; Muñoz, César (eds.). Proceedings STRATA 2003. First International Workshop on Design and Application of Strategies/Tactics in Higher Order Logics; Focus on PVS Experiences (PDF). Conference Publications. Vol. NASA/CP-2003-212448. NASA Scientific and Technical Information Program Office. pp. 56–68. S2CID 11201048. https://ntrs.nasa.gov/api/citations/20030067561/downloads/20030067561.pdf ↩
Segre, Alberto Maria; Sturgill, David B. (1994). "Using Hundreds of Workstations to Solve First-Order Logic Problems" (PDF). AAAI-94 Proceedings. https://www.aaai.org/Papers/AAAI/1994/AAAI94-029.pdf ↩
Benzmüller, Christoph; Rabe, Florian; Sutcliffe, Geoff (2008). "THF0 – The Core of the TPTP Language for Higher-Order Logic". Automated Reasoning. Lecture Notes in Computer Science. Vol. 5195. pp. 491–506. doi:10.1007/978-3-540-71070-7_41. ISBN 978-3-540-71069-1. 978-3-540-71069-1 ↩