Elimination of equality via transformation with ordering constraints [chapter]

Leo Bachmair, Harald Ganzinger, Andrei Voronkov
1998 Lecture Notes in Computer Science  
We refine Brand's method for eliminating equality axioms by (i) imposing ordering constraints on auxiliary variables introduced during the transformation process and (ii) avoiding certain transformations of positive equations with a variable on one side. The refinements are both of theoretical and practical interest. For instance, the second refinement is implemented in Setheo and appears to be critical for that prover's performance on equational problems. The correctness of this variant of
more » ... d's method was an open problem that is solved by the more general results in the present paper. The experimental results we obtained from a prototype implementation of our proposed method also show some dramatic improvements of the proof search in model elimination theorem proving. We prove the correctness of our refinements of Brand's method by establishing a suitable connection to basic paramodulation calculi and thereby shed new light on the connection between different approaches to equational theorem proving.
doi:10.1007/bfb0054259 fatcat:xsztle3oofbhbag2nka7havaoy