We introduce FRAT, a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to DRAT, the FRAT format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to LRAT. The format is easy to parse forward and backward, and it is extensible to future proof methods. The provision of optional proof steps allows SAT solver developers to balance implementation effort against elaboration time, with little to no overhead on solver time. We benchmark our FRAT toolchain against a comparable DRAT toolchain and confirm >84% median reduction in elaboration time and >94% median decrease in peak memory usage.

中文翻译：

---

SAT Solver-Elaborator 通信的灵活证明格式

我们介绍了 FRAT，一种用于不可满足的 SAT 问题的新证明格式及其相关工具链。与 DRAT 相比，FRAT 格式允许求解器在证明中包含更多信息，以减少后续细化到 LRAT 的计算成本。该格式易于向前和向后解析，并且可以扩展到未来证明方法。提供可选的证明步骤允许 SAT 求解器开发人员平衡实现工作与细化时间，几乎没有求解器时间开销。我们将我们的 FRAT 工具链与可比的 DRAT 工具链进行了基准测试，并确认精化时间的中位数减少了 84% 以上，并且峰值内存使用的中位数减少了 94% 以上。