This paper proposes a unified representation of individual instances of the resubstitution problem and several solvers with different runtime/quality tradeoffs that cover a broad range of use-cases in logic synthesis and formal verification.
First-order encodings in both TPTP and SMT-LIB formats are provided, together with scripts that automatically generate benchmark instances, and these benchmarks are evaluated on state-of-the-art automated theorem provers and SMT solvers.
Julie Cailler, Noé Delorme, S. Tourret· 0 citations
We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is $\Pi^1_\infty$-complete, and, more strongly, computably isomorphic to true second-order arithmetic. The lower bound is established for the next-time Boolean-goal fragment of Strategy Logic. Consequently, Strategy Log...
This work presents a proof trimmer for Boolean satisfiability solving, and shows how this technique can be used to reduce proof size and proof checking time for richer combinatorial paradigms.
Berhan Oumer Adame, Bart Bogaerts, Benjamin Bogø et al.· 0 citations
