Download PDFOpen PDF in browserBenchmarking LLMs Against TPTP: A Vision for the Near Future4 pages•Published: October 24, 2026AbstractWe propose the TPTP World as a benchmark for evaluating LLMs' reasoning in which success is a TPTP derivation verified by independent verifiers. We describe the design of Proof Assistant for Agents (PAFA), an interface in which an AI agent states claims and premises, justified by a primitive rule or by automation of configurable strength. A finished proof is serialized directly as the TPTP derivation. We give the operation set for PAFA, a pipeline, and an evaluation protocol, and leave the underlying proof system, the automation boundary, and the proof state's retrieval mechanism open.Keyphrases: automated theorem proving, benchmarking, large language models, proof verification, tptp In: Stephan Schulz, Konstantin Korovin and Michael Rawson (editors). Proceedings of 16th International Workshop on the Implementation on Logics. Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning (short papers), vol 23, pages 129-132.
|

