SAT-Inspired Eliminations for Superposition

Petar Vukmirović (1) , Jasmin Blanchette (2, 3) , Marijn J H Heule (4)

1 VU - Vrije Universiteit Amsterdam [Amsterdam]
2 Computer Systems Section - Vrije Universiteit Amsterdam
3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
4 CMU - Carnegie Mellon University [Pittsburgh]

Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to firstorder logic with equality. In this paper, we port inprocessing techniques to work with superposition, and we strengthen preprocessing. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.

Domaines: Logique en informatique [cs.LO]

Petar Vukmirović, Jasmin Blanchette, Marijn J H Heule. SAT-Inspired Eliminations for Superposition. FMCAD 2021 - 21st International Conference on Formal Methods in Computer-Aided Design, Oct 2021, New Haven, CT / virtual, United States. pp.231-240, ⟨10.5281/zenodo.4552499⟩. ⟨hal-03485200⟩