Extending Sledgehammer with SMT Solvers
- Cite this paper as:
- Blanchette J.C., Böhme S., Paulson L.C. (2011) Extending Sledgehammer with SMT Solvers. In: Bjørner N., Sofronie-Stokkermans V. (eds) Automated Deduction – CADE-23. CADE 2011. Lecture Notes in Computer Science, vol 6803. Springer, Berlin, Heidelberg
Sledgehammer is a component of Isabelle/HOL that employs first-order automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects relevant facts and, if an ATP is successful, produces a snippet that replays the proof in Isabelle. We extended Sledgehammer to invoke satisfiability modulo theories (SMT) solvers as well, exploiting its relevance filter and parallel architecture. Isabelle users are now pleasantly surprised by SMT proofs for problems beyond the ATPs’ reach. Remarkably, the best SMT solver performs better than the best ATP on most of our benchmarks.
Unable to display preview. Download preview PDF.