Preprint
Article

This version is not peer-reviewed.

SatyPy: A Boolean Satisfiability Solver Through Independent Domination

Submitted:

08 November 2026

Posted:

16 November 2026

You are already at the latest version

Abstract
SatyPy is a Python package that decides Boolean formulas in conjunctive normal form through a graph problem, and this paper describes its version 0.0.6. The graph of a formula has a vertex for every literal and for every clause, an edge between the two literals of each variable, and an edge between each clause and each of its literals. We prove that the independent dominating sets of this graph that contain no clause vertex are exactly the satisfying assignments, one literal per variable. SatyPy simplifies the formula by unit propagation and pure literals, eliminates over \( \mathrm{GF}(2) \) the exclusive-or constraints that its clauses write, decides the residual formula exactly if all its clauses have two literals, and otherwise looks for such a set with a weighted local search and branches on a shortest clause falsified by the set found, up to depth \( \max(2,\lfloor\log_3(m+N)\rfloor) \) for \( m \) clauses and \( N \) variables. We prove that every answer SATISFIABLE carries a verified assignment, so that the only error of SatyPy is a false negative, a satisfiable formula answered UNSATISFIABLE; that an answer UNSATISFIABLE is proved when it comes from an exact stage and otherwise rests on the completeness of the search, which on formulas with two or three literals per clause would imply \( \mathrm{P}=\mathrm{NP} \); and that the expected running time is \( O(R\,(\|\varphi\|+N\log N+F)) \), with \( R \) the number of searches of the branching and \( F=400\,000 \), which is \( O((N+m)(\|\varphi\|+N\log N+F)) \) for formulas with at most three literals per clause. A wrong answer UNSATISFIABLE on a satisfiable formula requires the failure of \( d+1 \) searches on satisfiable formulas. Since the error is one-sided, we study the randomized variant of the procedure, in which every search draws its seed at random: if every search on a satisfiable residual formula fails with probability at most \( p \), an answer UNSATISFIABLE on a satisfiable formula has probability at most \( p^{d+1}\le p^{3} \), and a constant \( p<1 \) would place the satisfiability of formulas with at most three literals per clause in the randomized class \( \mathrm{RP} \), that is, \( \mathrm{NP}=\mathrm{RP} \), because the probability is at most \( \tfrac14 \) once \( d \) exceeds a constant that depends on \( p \) and the remaining inputs have bounded size. The same conclusion holds if the reliability is assumed only on formulas with a unique solution, by the reduction of Valiant and Vazirani. In reproducible experiments, the answers agree with exhaustive search on all 188 small formulas, with MiniSat on all 90 random 3-CNF formulas that MiniSat decides, and with the known answers on all 72 formulas of the DIMACS \( \texttt{aim} \) benchmark, and the first search succeeded on each of the 226 satisfiable formulas that it had to decide, and a search for a counterexample on 167 satisfiable formulas with few solutions or a rigid structure, in 501 runs, found none. On the 375 satisfiable formulas of the experiments that reach the search, none failed: the one-sided Clopper--Pearson upper bound at confidence 95% on the failure probability of a search is 0.00796, and for this value the bound \( p^{d+1} \) is at most \( 5.1\cdot10^{-7} \). Running SatyPy on large formulas is not practical.
Keywords: 
;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.