DRAT proof
A machine-checkable proof format output by SAT solvers, used to verify the unsatisfiability of Boolean formulas. It can be validated by independent checkers.
Timeline (last 90 days)
DRAT proof checking verified that codes do not exist for certain parameters, providing 115 verified code records and 10 non-existence results with checked DRAT proofs.
DRAT (Deletion Resolution Asymmetric Tautology) proofs are a machine-checkable proof format output by SAT solvers, used to verify the unsatisfiability of Boolean formulas.
All Facts (2)
DRAT proof checking verified that codes do not exist for certain parameters, providing 115 verified code records and 10 non-existence results with checked DRAT proofs.
50%UnverifiedDRAT (Deletion Resolution Asymmetric Tautology) proofs are a machine-checkable proof format output by SAT solvers, used to verify the unsatisfiability of Boolean formulas.
50%