Formalization of Bachmair and Ganzinger's Ordered Resolution Prover

Anders Schlichtkrull 🌐, Jasmin Christian Blanchette 📧, Dmitriy Traytel 🌐 and Uwe Waldmann 📧

January 18, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This Isabelle/HOL formalization covers Sections 2 to 4 of Bachmair and Ganzinger's "Resolution Theorem Proving" chapter in the Handbook of Automated Reasoning. This includes soundness and completeness of unordered and ordered variants of ground resolution with and without literal selection, the standard redundancy criterion, a general framework for refutational theorem proving, and soundness and completeness of an abstract first-order prover.


BSD License


Session Ordered_Resolution_Prover