We re-examine the topic of machine-learned clause selection guidance in saturation-based
theorem provers. The central idea, recently popularized by the ENIGMA system, is to learn a …

The DISCOUNT system is a distributed equational theorem prover based on the teamwork
method for knowledge-based distribution. It uses an extended version of unfailing Knuth …

Abstract Specification-based retrieval provides exact content-oriented access to component
libraries but requires too much deductive power. Specification-based browsing evades this …

Vampire has been for a long time the strongest first-order automatic theorem prover, widely
used for hammer-style proof automation in ITPs such as Mizar, Isabelle, HOL, and Coq. In …

Automated theorem provers and formal proof assistants are general reasoning systems that
are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems …

One of the major problems in clausal theorem proving is the control of the proof search. In
the presence of equality, this problem is particularly hard, since nearly all state-of-the-art …

This paper discusses the usse of data-mining for the automatic formation of tactics. It was
presented at the Workshop on Computer-Supported Mathematical Theory Development …

Clause selection plays a crucial role in modern saturation-based automatic theorem provers.
A commonly used heuristic suggests prioritizing small clauses, ie, clauses with few symbol …

Waldmeister is an automated theorem prover for unconditional equational logic. It is based
on unfailing Knuth-Bendix completion [1]. During the rst stage of development the focus was …

The architecture of the WALDMEISTER prover for unit equational deduction is based on a
strict separation of active and passive facts. After an inspection of the system's proof …