Mate SoosMate Soos

CryptoMiniSat 3.2.0 released

msoos — Mon, 29 Apr 2013 20:12:58 +0000

CyptoMinSat 3.2.0 has been released. This code should be extremely stable and should contain no bugs. In case it does, CryptoMiniSat will fail quite bady at the competition. I have fuzzed the solver for about 2-3000 CPU hours, with some sophisticated fuzzers (all available here — most of them not mine) so all should be

GCC 4.5.2 at the SAT Competition’13

msoos — Fri, 26 Apr 2013 23:17:35 +0000

(Note update below) Just a short note. All MiniSat-derived SAT solvers might give wrong results during the competition. No, MiniSat doesn’t have a bug. GCC has a giant bug. Vegard reported this years ago — I personally put about 12h tracking it down, posted it to the CryptoMiniSat mailing list, and Vegard took it up,

Certified UNSAT and CryptoMiniSat

msoos — Thu, 25 Apr 2013 19:49:13 +0000

Marijn Heule kindly sent me an email on the 10th of April about DRUP, the new system used this year in the SAT Competition’13 for the UNSAT track. He kindly encouraged me to implement the DRUP system. He personally implemented it into Minisat which was a very helpful lead for me. In this post I

A variable elimination improvement

msoos — Sun, 21 Apr 2013 15:55:57 +0000

Lately, I have been thinking about how to improve variable elimination. It’s one of the most important things in SAT solvers, and it’s not exactly easy to do right. Variable elimination Variable elimination simply resolves every occurrence of a literal with every occurrence of the literal , removes the original clauses and adds the resolvents.

CryptoMinisat 3.1 released

msoos — Sun, 14 Apr 2013 17:29:50 +0000

CryptoMinisat 3.1 has been released. The short changelog is: [crayon-5197b7acf3841/] The changes made were threefold. First, memory usage has been greatly reduced. This is crucial, because memory usage was over 7GB on certain instances. Secondly, the implication cache wasn’t very well-used and an idea that came to my mind greatly improved performance on most problems.