SAT-Inspired Eliminations for Superposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2023

SAT-Inspired Eliminations for Superposition


Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. 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.
Fichier principal
Vignette du fichier
jour.pdf (656.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04298574 , version 1 (21-11-2023)




Petar Vukmirović, Jasmin Blanchette, Marijn J H Heule. SAT-Inspired Eliminations for Superposition. ACM Transactions on Computational Logic, 2023, 24 (1), pp.1-25. ⟨10.1145/3565366⟩. ⟨hal-04298574⟩
13 View
10 Download



Gmail Mastodon Facebook X LinkedIn More