Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Reconstruction Proofs at the Assertion Level
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
System Description: SystemOn TPTP
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
MPTP 0.2: Design, Implementation, and Initial Experiments
Journal of Automated Reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
Translating Higher-Order Clauses to First-Order Clauses
Journal of Automated Reasoning
Property-directed incremental invariant generation
Formal Aspects of Computing
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Source-level proof reconstruction for interactive theorem proving
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
Integrating an automated theorem prover into agda
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Automating induction with an SMT solver
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Improved single pass algorithms for resolution proof reduction
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Challenges and experiences in managing large-scale proofs
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Electronic Notes in Theoretical Computer Science (ENTCS)
Improved single pass algorithms for resolution proof reduction
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
PRocH: proof reconstruction for HOL light
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automating theorem proving with SMT
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
MaSh: machine learning for sledgehammer
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS and Vampire. This paper is the largest and most detailed empirical evaluation of such a link to date. Our test data consists of 1240 proof goals arising in 7 diverse Isabelle theories, thus representing typical Isabelle proof obligations. We measure the effectiveness of Sledgehammer and many other parameters such as run time and complexity of proofs. A facility for minimizing the number of facts needed to prove a goal is presented and analyzed.