The corrected Cook–Levin tableau preserves the number of accepting certificates
ProvedCountOrderings.NFree.countedCookLevinReduction_preserves_countFix a well-formed polynomial-time verifier and a polynomial length bound for its accepted certificates. For each input, the corrected Cook–Levin CNF has exactly as many satisfying assignments to its occurring variables as the verifier has accepting certificates. The CNF pins the syntactically present but unreachable head positions at cell with negative unit clauses.
Preamble
import Definitions.Def_CountOrderings_NFree_CountingTableau open CookLevin
Formal statement
namespace CountOrderings.NFree
theorem countedCookLevinReduction_preserves_count {Mv : Machine} {k G cw dw ct dt : ℕ}
(hwf : TuringMachine k G Mv) {V : List Bool → List Bool → Bool}
(hdec : ∀ x w : List Bool, DecidesIn Mv k (boolsToSymbols x) (boolsToSymbols w)
(polyBound ct dt (x.length + w.length)) (V x w))
(hlenV : ∀ x w : List Bool, V x w = true → w.length ≤ polyBound cw dw x.length)
(x : List Bool) :
countEncodedCNF (countedCookLevinReduction Mv k G cw dw ct dt x) =
{w : List Bool | V x w = true}.ncard := by sorry
end CountOrderings.NFreeSource
Cook–Levin tableau correspondence on the platform, https://prove2.me/theorems/b5d75d8e-6bbb-49a3-bd6d-e25ba880e328, counting refinement for the #X3C source of Theorem 6.3