DeepAI
Log In Sign Up

A Flexible Proof Format for SAT Solver-Elaborator Communication

09/20/2021
by   Seulkee Baek, et al.
0

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 memory usage.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/06/2021

Alethe: Towards a Generic SMT Proof Format (extended abstract)

The first iteration of the proof format used by the SMT solver veriT was...
05/03/2021

Generating Extended Resolution Proofs with a BDD-Based SAT Solver

In 2006, Biere, Jussila, and Sinz made the key observation that the unde...
06/28/2019

DRAT-based Bit-Vector Proofs in CVC4

Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for t...
07/27/2022

Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses

We give a first account of our new parallel SAT solver Gimsatul. Its key...
03/10/2019

Knowledge compilation languages as proof systems

In this paper, we study proof systems in the sense of Cook-Reckhow for p...
03/18/2021

Enhanced AGCM3D: A Highly Scalable Dynamical Core of Atmospheric General Circulation Model Based on Leap-Format

The finite-difference dynamical core based on the equal-interval latitud...
06/02/2020

SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers

SAT research has a long history of source code and binary releases, than...