By interactive theorem proving, we mean some arrangement where the machine and a
human user work together interactively to produce a formal proof. There is a wide spectrum …

We present a concept for an automated theorem prover that employs a search control based
on ideas from several areas of artificial intelligence (AI). The combination of case-based …

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 …

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 …

Large formal mathematical libraries consist of millions of atomic inference steps that give
rise to a corresponding number of proved statements (lemmas). Analogously to the informal …

This paper describes two data-exchange formats for Automated Theorem Proving (ATP)
tools. First, a language for writing the problems that are input to ATP systems, and for writing …

One of the keys to the success of the TPTP and related projects is their consistent use of the
TPTP language. The ability of the TPTP language to express solutions as well as problems …

This chapter surveys the research in parallel or distributed strategies for mechanical
theorem proving in first-order logic, and explores some of its connections with the research …

Twee is an automated theorem prover for equational logic. It implements unfailing Knuth-
Bendix completion with ground joinability testing and a connectedness-based redundancy …

This paper presents a taxonomy of parallel theorem-proving methods based on the control
of search (eg, master–slaves versus peer processes), the granularity of parallelism (eg, fine …