OTTER is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-o... View more
64 65 65 67  W. Bledsoe and D. Loveland, editors. Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics. AMS, 1984.
 N. Dershowitz. Termination of rewriting. J. Symbolic Computation, 3:69-116, 1987.
 W. McCune and O. Shumsky. IVY: A preprocessor and proof checker for first-order logic. In M. Kaufmann, P. Manolios, and J Moore, editors, Computer-Aided Reasoning: ACL2 Case Studies, chapter 16. Kluwer Academic, 2000.