{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:46:53Z","timestamp":1753886813467},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Inspired by the success of the DRAT proof format for certification of boolean satisfiability (SAT),<\/jats:p><jats:p>we argue that a similar goal of having unified automatically checkable proofs should be sought<\/jats:p><jats:p>by the developers of automated first-order theorem provers (ATPs). This would not only<\/jats:p><jats:p>help to further increase assurance about the correctness of prover results,<\/jats:p><jats:p>but would also be indispensable for tools which rely on ATPs,<\/jats:p><jats:p>such as ``hammers'' employed within interactive theorem provers.<\/jats:p><jats:p>The current situation, represented by the TSTP format is unsatisfactory,<\/jats:p><jats:p>because this format does not have a standardised semantics and thus cannot be checked automatically.<\/jats:p><jats:p>Providing such semantics, however, is a challenging endeavour. One would ideally<\/jats:p><jats:p>like to have a proof format which covers only-satisfiability-preserving operations such as Skolemisation<\/jats:p><jats:p>and is versatile enough to encompass various proving methods (i.e. not just superposition)<\/jats:p><jats:p>or is perhaps even open ended towards yet to be conceived methods or at least easily extendable in principle.<\/jats:p><jats:p>Going beyond pure first-order logic to theory reasoning in the style of SMT or<\/jats:p><jats:p>beyond proofs to certification of satisfiability are further interesting challenges.<\/jats:p><jats:p>Although several projects have already provided partial solutions in this direction,<\/jats:p><jats:p>we would like to use the opportunity of ARCADE to further promote the idea and<\/jats:p><jats:p>gather critical mass needed for its satisfactory realisation.<\/jats:p>","DOI":"10.29007\/s6d1","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:06:06Z","timestamp":1516748766000},"page":"55-45","source":"Crossref","is-referenced-by-count":3,"title":["Checkable Proofs for First-Order Theorem Proving"],"prefix":"10.29007","volume":"51","author":[{"given":"Giles","family":"Reger","sequence":"first","affiliation":[]},{"given":"Martin","family":"Suda","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:06:06Z","timestamp":1516748766000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/5W2B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/s6d1","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}