The binary propositional resolution rule is sound

Identifier: F:resolution-rule-sound
Proof route: smt-term-level
External status: proved
Axiom footprint: axeyum-ir.bool-evaluator, classical-two-valued-bool-semantics

Recorded description

For all propositions p, q, r: if (p or q) holds and ((not p) or r) holds, then (q or r) holds.

Formal statement

(assert (=> (and (or p q) (or (not p) r)) (or q r)))

Dependencies

The graph shows direct ledger edges. Follow a node to open its artifact page.

0 direct dependencies 0 direct dependents

Evidence

resolution-rule-sound-term-level

Kind: exhaustive-enumeration
Status: checked

Supports: For all propositions p, q, r: if (p or q) holds and ((not p) or r) holds, then (q or r) holds.

Checker command

test "$(cargo run -q -p axeyum-bench --example smtcomp_cli -- --evidence artifacts/facts/smt2/neg-resolution-rule-sound.smt2 2>/dev/null | tail -1)" = unsat

Evidence notes

Ran 2026-08-14: the file asserts the NEGATION of formal.statement and the solver reported `unsat` with `kind=unsat-term-level certified=1 arena=ok`. `unsat-term-level` is exhaustive evaluation of the 8 Boolean assignments by the axeyum-ir evaluator alone -- it trusts neither the bit-blaster, the CNF encoder, nor the SAT solver. `arena=ok` means Evidence::check re-ran that enumeration against a FRESH PARSE of the file, independent of anything the producing solve held in memory. Independently cross-checked: `z3 -smt2` on the same file also reports `unsat`.

Provenance

{
  "date": "2026-08-14",
  "established_by": "facts-logic lane, axeyum SAT/SMT front door",
  "source": "authored from the S:logic-and-proof strand of the math-education concept graph; statement written here, not copied",
  "prior_art": [
    {
      "citation": "J. A. Robinson (1965), 'A Machine-Oriented Logic Based on the Resolution Principle', Journal of the ACM 12(1)",
      "establishes": "the resolution principle, its soundness, and its refutation-completeness",
      "attribution": "standard textbook attribution; this lane did not consult the primary source, and records the citation as the received one"
    },
    {
      "citation": "M. Davis and H. Putnam (1960), 'A Computing Procedure for Quantification Theory', Journal of the ACM 7(3)",
      "establishes": "the propositional antecedent of the rule",
      "attribution": "standard textbook attribution; this lane did not consult the primary source, and records the citation as the received one"
    }
  ]
}