2026-07-24T08:19:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18483 2024-03-06T11:02:01Z ddc:004 open_access

Faster LRAT Checking Than Solving with CaDiCaL Pollitt, Florian Fleury, Mathias Biere, Armin SAT solving Proof Checking DRAT LRAT FRAT DRAT is the standard proof format used in the SAT Competition. It is easy to generate but checking proofs often takes even more time than solving the problem. An alternative is to use the LRAT proof system. While LRAT is easier and way more efficient to check, it is more complex to generate directly. Due to this complexity LRAT is not supported natively by any state-of-the-art SAT solver. Therefore Carneiro and Heule proposed the mixed proof format FRAT which still suffers from costly intermediate translation. We present an extension to the state-of-the-art solver CaDiCaL which is able to generate LRAT natively for all procedures implemented in CaDiCaL. We further present Lrat-Trim, a tool which not only trims and checks LRAT proofs in both ASCII and binary format but also produces clausal cores and has been tested thoroughly. Our experiments on recent competition benchmarks show that our approach reduces time of proof generation and certification substantially compared to competing approaches using intermediate DRAT or FRAT proofs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Florian Pollitt and Mathias Fleury and Armin Biere 2023 Is Part Of LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAT.2023.21 urn:nbn:de:0030-drops-184837 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.21 eng https://creativecommons.org/licenses/by/4.0/legalcode