Extending Sledgehammer with SMT Solvers

  • Jasmin Christian Blanchette
  • Sascha Böhme
  • Lawrence C. Paulson
Conference paper

DOI: 10.1007/978-3-642-22438-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6803)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Sascha Böhme
    • 1
  • Lawrence C. Paulson
    • 2
  1. 1.Institut für InformatikTechnische Universität MünchenGermany
  2. 2.Computer LaboratoryUniversity of CambridgeU.K.

Personalised recommendations