Journal of Automated Reasoning

, Volume 56, Issue 2, pp 155–200

Semi-intelligible Isar Proofs from Machine-Generated Proofs

  • Jasmin Christian Blanchette
  • Sascha Böhme
  • Mathias Fleury
  • Steffen Juilf Smolka
  • Albert Steckermeier
Article

DOI: 10.1007/s10817-015-9335-3

Cite this article as:
Blanchette, J.C., Böhme, S., Fleury, M. et al. J Autom Reasoning (2016) 56: 155. doi:10.1007/s10817-015-9335-3

Abstract

Sledgehammer is a component of the Isabelle/HOL proof assistant that integrates external automatic theorem provers (ATPs) to discharge interactive proof obligations. As a safeguard against bugs, the proofs found by the external provers are reconstructed in Isabelle. Reconstructing complex arguments involves translating them to Isabelle’s Isar format, supplying suitable justifications for each step. Sledgehammer transforms the proofs by contradiction into direct proofs; it iteratively tests and compresses the output, resulting in simpler and faster proofs; and it supports a wide range of ATPs, including E, LEO-II, Satallax, SPASS, Vampire, veriT, Waldmeister, and Z3.

Keywords

Automatic theorem provers Proof assistants Natural deduction 

Copyright information

© Springer Science+Business Media Dordrecht 2015

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
    • 2
  • Sascha Böhme
    • 3
  • Mathias Fleury
    • 2
    • 4
  • Steffen Juilf Smolka
    • 5
  • Albert Steckermeier
    • 3
  1. 1.Inria Nancy & LORIA, Équipe VeriDisVillers-lès-NancyFrance
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany
  3. 3.Institut für InformatikTechnische Universität MünchenGarchingGermany
  4. 4.École normale supérieure de Rennes, Campus de Ker LannBruzFrance
  5. 5.Department of Computer ScienceCornell UniversityIthacaUSA