Context
The upper bound is general; the lower bound identifies the first seed size at which a width-w retained clause can become visible to UP.
Hypotheses and scope
- for the separating family.
- Added clauses have width at most ; allowing wider additions changes the radius.
Proof or evidence
CRD-SAT-12a gives the upper bound . The preserved Run 25 family has a width- addition that is inactive on every smaller seed and becomes unit on an explicit seed of size , giving the matching lower bound. Widths three through eight were rerun as finite corroboration.
Verification notes
The upper and lower bounds were kept logically separate. The lower-bound family is now stated and proved as CRD-SAT-11a.
Limitations
- The width bound applies to the added clauses, not necessarily every clause in the base.
- The result does not bound interaction depth when learned-clause width is unbounded.