Journal of Automated Reasoning

, Volume 51, Issue 1, pp 109–128

Extending Sledgehammer with SMT Solvers

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

DOI: 10.1007/s10817-013-9278-5

Cite this article as:
Blanchette, J.C., Böhme, S. & Paulson, L.C. J Autom Reasoning (2013) 51: 109. doi:10.1007/s10817-013-9278-5

Abstract

Sledgehammer is a component of Isabelle/HOL that employs resolution-based 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. The ATPs and SMT solvers nicely complement each other, and Isabelle users are now pleasantly surprised by SMT proofs for problems beyond the ATPs’ reach.

Keywords

SMT solvers Automatic theorem provers Interactive theorem provers 

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

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

Personalised recommendations