SAT solvers decide the satisfiability of Boolean formulas in conjunctive normal form. They are commonly used for software and hardware verification. Modern SAT solvers are highly complex and optimized programs. As a single bug in the solver may invalidate the verification of many systems, SAT solvers output certificates for their answer, which are then checked independently. However, even certificate checking requires highly optimized non-trivial programs. This paper presents the first SAT solver certificate checker that is formally verified down to the integer sequence representing the formula. Our tool supports the full DRAT standard, and is even faster than the unverified state-of-the-art tool drat-trim , on a realistic set of benchmarks drawn from the 2016 and 2017 SAT competitions. An optional multi-threaded mode further reduces the runtime, in particular for big certificates.

中文翻译：

---

高效的验证 (UN)SAT 证书检查

SAT 求解器确定合取范式中布尔公式的可满足性。它们通常用于软件和硬件验证。现代 SAT 求解器是高度复杂和优化的程序。由于求解器中的单个错误可能会使许多系统的验证无效，因此 SAT 求解器会输出其答案的证书，然后对其进行独立检查。然而，即使是证书检查也需要高度优化的非平凡程序。本文介绍了第一个 SAT 求解器证书检查器，它被正式验证为表示公式的整数序列。我们的工具支持完整的 DRAT 标准，在 2016 年和 2017 年 SAT 比赛中得出的一组现实基准上，甚至比未经验证的最先进工具 drat-trim 还要快。可选的多线程模式进一步减少了运行时间，