Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem

These archives contain the proofs accompanying the paper Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem (appearing in the 2020 proceedings of the International Joint Conference on Artificial Intelligence).

Each archive contains a satisfiability instance and a DRAT certificate proving that the instance is unsatisfiable.  In the cases 1a–c the instance has been split into hundreds of smaller subinstances.  A makefile is provided that will generate the satisfiability instance in each subinstance.  For example, to generate the subinstance with index 0 in case 1a you can run the following:

make -f makefile-1a 1a.0.block.cnf

For more information and the generation scripts, see the MathCheck website.