206 followers
Now the gist: https://t.co/KWDa5S9fJt explains algorithm (satisfaction-driven clause learning, SDCL) that can produce short (O(n^3)) proofs for unsatisfiability of pigeonhole problems. minisat can't solve pigeonhole n=12 in a day, SaDiCaL (SDCL solver mana