## Extending Sledgehammer with SMT Solvers

### Cached

### Download Links

Citations: | 15 - 6 self |

### BibTeX

@MISC{Blanchette_extendingsledgehammer,

author = {Jasmin Christian Blanchette and Sascha Böhme and Lawrence C. Paulson},

title = {Extending Sledgehammer with SMT Solvers},

year = {}

}

### OpenURL

### Abstract

Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder 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. 1