We show in this paper that the application of the resolution principle to a set of clauses can be regarded as the construction of a term rewriting system confluent on valid formulas. This result allows the extension of standard properties and methods of equational theories (such as Birkhoff’s theorem and Knuth and Bendix completion algorithm) to quantifier-free first order predicate calculus.