SMELS: Satisfiability Modulo Equality with Lazy Superposition

  • Authors:

  • Christopher Lynch;Quang-Trung Ta;Duc-Khanh Tran

  • Affiliations:

  • Department of Mathematics and Computer Science, Clarkson University, Potsdam, USA 13699-5815;School of Computing, National University of Singapore, Singapore, Singapore 117417;School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of checking satisfiability of quantified formulae in First Order Logic with Equality. We propose a new procedure for combining SAT solvers with Superposition Theorem Provers to handle quantified formulae in an efficient and complete way. In our procedure, the input formula is converted into CNF as in traditional first order logic theorem provers. The ground clauses are given to the SAT solver, which runs a DPLL method to build partial models. The partial model is reduced, and then passed to a Superposition procedure, along with justifications of literals. The Superposition procedure then performs an inference rule, which we call Justified Superposition, between the ground literals and the nonground clauses, plus usual Superposition rules with the nonground clauses. Any resulting ground clauses are provided to the DPLL engine. We prove the completeness of our procedure, using a nontrivial modification of the Bachmair and Ganzinger's model generation technique. We have implemented a theorem prover based on this idea by reusing state-of-the-art SAT solver and Superposition Theorem Prover. Our theorem prover inherits the best of both worlds: a SAT solver to handle ground clauses efficiently, and a Superposition theorem prover which uses powerful orderings to handle the nonground clauses. Experimental results are promising, and hereby confirm the viability of our method.