The main ingredients underlying this approach are efficient automatic theorem provers that
can cope with hundreds of axioms, suitable translations of the proof assistant's logic to the …

Sledgehammer integrates automatic theorem provers in the proof assistant Isabelle/HOL. A
key component, the fact selector, heuristically ranks the thousands of facts (lemmas …

Sledgehammer integrates automatic theorem provers in the proof assistant Isabelle/HOL. A
key component, the relevance filter, heuristically ranks the thousands of facts available and …

Most automated theorem provers suffer from the problem that they can produce proofs only
in formalisms difficult to understand even for experienced mathematicians. Effort has been …

This paper presents HARP, a complete, tableau-based theorem prover for first order logic,
which is intended to be used both interactively and as an inference engine for Artificial …

Interactive proof assistants should verify the proofs they receive from automatic theorem
provers. Normally this proof reconstruction takes place internally, forming part of the …

We present a generic approach to readable formal proof documents, called Intelligible semi-
automated reasoning (Isar). It addresses the major problem of existing interactive theorem …

We describe a number of new possibilities for current theorem provers that arise with the
existence of large integral bodies of formalized mathematics. Then we describe the …

This paper describes Hipster, a system integrating theory exploration with the proof assistant
Isabelle/HOL. Theory exploration is a technique for automatically discovering new …

We explore the application of transformer-based language models to automated theorem
proving. This work is motivated by the possibility that a major limitation of automated …