We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger’s chapter on resolution theorem proving, culminating with a refutationally complete first-order prover based on ordered resolution with literal selection. We developed general infrastructure and methodology that can form the basis of completeness proofs for related calculi, including superposition. Our work clarifies fine points in the chapter, emphasizing the value of formal proofs in the field of automated reasoning.

中文翻译：

---

形式化 Bachmair 和 Ganzinger 的有序解析证明器

我们展示了 Bachmair 和 Ganzinger 的关于解析定理证明的章节前半部分的 Isabelle/HOL 形式化，最终以基于具有文字选择的有序解析的反驳完备的一阶证明者告终。我们开发了通用基础设施和方法，可以构成相关演算（包括叠加）的完整性证明的基础。我们的工作阐明了本章中的要点，强调了形式证明在自动推理领域的价值。