Resolution or DRAT/RUP correspondence for CTS clearing

Prove that clearing derivations for single-forbidden Compact Triplets Structures can be simulated by a short sequence of resolution steps and formally map those CTS derivations to DRAT or RUP proof certificates.

Background

For the sliding-window fragment, each tier contains one forbidden triplet and clearing is formally shown to run in polynomial time. The paper observes that triplet removal in this restricted setting resembles unit-propagation-based simplification.

A formal correspondence between CTS derivations and established SAT certificate formats would allow the verified kernel to produce independently checkable certificates rather than merely verify assignments or external proofs.