Orthologic SAT Solver Outperforms Kissat on Hard Benchmarks

An innovative algorithm for orthologic entailment eliminates the need for expensive preprocessing, all while preserving a worst-case complexity of O(n^2(1+|A|)). The researchers present synthetic SAT benchmarks derived from the tautology φ ↔ NF_OL(φ), where the Tseitin encoding yields unsatisfiable cases that challenge leading solvers such as Kissat but allow for concise orthologic proofs. When tested on EPFL arithmetic circuits, this algorithm effectively resolves these cases, whereas Kissat fails to complete a considerable number. Implementing orthologic normalization as a preprocessing phase can enhance SAT solving efficiency for certain difficult problems.