Context
The theorem asks how deeply unit propagation must be tested before bounded-width retained clauses are known to preserve every UP consequence.
Definitions
- For , the boundary seed falsifies every literal of except .
- Clause is UP-absorbed by when unit propagation from every either conflicts or derives .
Hypotheses and scope
- Clauses are normalized non-tautological sets of literals.
- The set is finite and every added clause has width at most .
- UP closure retains conflict as a distinct outcome.
Proof or evidence
Signature equality through depth handles every boundary seed and therefore implies absorption. A propagation-persistence lemma shows that consequences from a boundary seed survive every consistent extension unless a conflict appears. Hence an absorbed addition can never supply the first new unit or conflict beyond the base closure. This proves all-seed equality; restriction gives the reverse implication. The packet reports 110,397 finite configurations as corroboration.
Verification notes
The three implications and the propagation-persistence induction were reconstructed from the checkpoint. The proof applies to arbitrary bases and does not rely on the finite checker.
Limitations
- The theorem concerns exhaustive unit-propagation closure and conflict outcomes.
- Syntax-sensitive heuristics, clause activity, watches, reasons, acquisition, deletion, and proof cost remain outside the observer.
- No novelty or external-review claim is made.