Score: 0

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Published: July 15, 2025 | arXiv ID: 2507.11349v1

By: Julie Cailler, Simon Guilloud

Potential Business Impact:

Lets computers share and check math proofs.

Business Areas:
Semantic Web Internet Services

Motivated by the transfer of proofs between proof systems, and in particular from first order automated theorem provers (ATPs) to interactive theorem provers (ITPs), we specify an extension of the TPTP derivation text format to describe proofs in first-order logic: SC-TPTP. To avoid multiplication of standards, our proposed format over-specifies the TPTP derivation format by focusing on sequent formalisms. By doing so, it provides a high level of detail, is faithful to mathematical tradition, and cover multiple existing tools and in particular tableaux-based strategies. We make use of this format to allow the Lisa proof assistant to query the Go\'eland automated theorem prover, and implement a library of tools able to parse, print and check SC-TPTP proofs, export them into Coq files, and rebuild low-level proof steps from advanced ones.

Page Count
20 pages

Category
Computer Science:
Logic in Computer Science