Compile: Transforming Well-Formed Formulas to Clauses

Abstract

Chapter 2 explained how to write a theorem as a set of wffs. However, neither HERBY nor THEO attempt to find a proof of a theorem expressed in this format. Instead, both require the theorem to be expressed as a set of clauses consisting of the axioms, hypotheses, and negated conclusion. Then, using the clauses as input, an attempt is made to find a proof. The program COMPILE transforms wffs to clauses by carrying out the seven steps described in Section 3.1. Section 3.2 explains how to use COMPILE, with the actual details explained in Section 3.2.1. Examples are given in Section 3.2.2. It should be pointed out that the user can express a theorem as a set of clauses directly, circumventing the need to use COMPILE.