SAT-Based Subsumption Resolution
arXiv:2401.17832 · doi:10.1007/978-3-031-38499-8_11
Abstract
Subsumption resolution is an expensive but highly effective simplifying inference for first-order saturation theorem provers. We present a new SAT-based reasoning technique for subsumption resolution, without requiring radical changes to the underlying saturation algorithm. We implemented our work in the theorem prover Vampire, and show that it is noticeably faster than the state of the art.