In this paper we give a short introduction in first-order theorem proving and the use of the
theorem prover Vampire. We discuss the superposition calculus and explain the key …

E 2.3 is a theorem prover for many-sorted first-order logic with equality. We describe the
basic logical and software architecture of the system, as well as core features of the …

We describe the superposition‐based theorem prover E. E is a sound and complete prover
for clausal first order logic with equality. Important properties of the prover include strong …

In this article we describe VAMPIRE: a high‐performance theorem prover for first‐order
logic. As our description is mostly targeted to the developers of such systems and specialists …

We applied two state-of-the-art machine learning techniques to the problem of selecting a
good heuristic in a first-order theorem prover. Our aim was to demonstrate that sufficient …

This book can mark the coming of age of automated theorem proving (ATP). The process to
maturity has been a continuum, as it is for humans, but this book serves to mark the …

Superposition is among the most successful calculi for firstorder logic. Its extension to higher-
order logic introduces new challenges such as infinitely branching inference rules, new …

Leo-III is an automated theorem prover for extensional type theory with Henkin semantics
and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based …

Deciding the satisfiability of a Quantified Boolean Formula (QBF) is an important research
issue in Artificial Intelligence. Many reasoning tasks involving planning [1], abduction …

We analyze the performance of various clause selection heuristics for saturating first-order
theorem provers. These heuristics include elementary first-in/first-out and symbol counting …