Proof of `2-SAT Is Decided in Time Linear in the Word Times the Number of Variables`
groundedproofs/Lax117284Proofs/TwoSAT/Machine/Final.lean · lax-117284
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The program reads the word, scans it with the verified scanner of , checks the width of every clause, builds the implication graph in compressed sparse row form by a counting sort, and searches from both literals of every occurring variable; the searches are paid out of a potential that charges a constant to every variable and two searches to every occurring one, which gives the factor . The constant is .