 LRI, University of Paris-Sud | 
 |  LRI, University of Paris-Sud |
| Abstract: What can be told about the well-known contest? This third edition was great, and located in Vancouver (great place!). All results are available online from this site. You can read more about the contest by reading the Sat 2004 contest howtos. Added (July, 2004) : detailed poscript description of each solvers, and one check-your-solver-yourself section in this page. | |
| Some statistics about the competition |
- 2 organizers
:-) (Daniel Le Berre and Laurent Simon), - 3 judges (Fahiem Bacchus, Joao Marques-Silva and Hans Klein Buning)
- 25 solver main submitters (Alexander Nadel, Allen Van Gelder, Arist Kojevnikov, Armin Biere, Daniel Le Berre, Dave Tompkins, Eugene Nudelman, Frederic Lardeux, Hantao Zhang, Henry Kautz, Holger Hoos, HoonSang Jin, Ines Lynce, Ivor Spence, Jarrod Roy, Johan Alfredsson, Marijn Heule, Massimo Narizzano, N.S. Narayanaswamy, Niklas Een, Olivier Fourdrinoy, Renato Bruni, Richard Ostrowski, Wheeler Ruml, Xiao Yu Li, Zhaohui Fu)
- 55 solvers were used (adaptnovelty, brchaff, circus, circush0, circush1, cls, compsat, cquest, eqube1, eqube2, forklift, frankensat-high, frankensat-low, funex, gasat, isat1, isat2, isat3, jerusat1.3, kcnfs, lsatv1.1, march-001, march-007, march-eq-010, march-eq-100, minilearning.jar, modoc, nanosat, novelty35, novelty50, oepira, oepirb, oepirc, ofsat, qingting, quantor, rsaps, saprover, saps, sapsnr, sato4.2, sato4.3, satzilla, satzilla_nr, satzilla_r, satzoo_1.02, tts-2-0, unitwalk, walksatauto, walksatmp, walksatskc, werewolf, wllsatv1, zchaff, zchaff_rand)
- 2 clusters were used (here in Orsay and one in Vancouver)
- 516 CPU days elapsed (459 in Orsay, 57 in Vancouver) in more that 60,000 launchs
- Buggy solvers are solvers that answered at least one time "UNSAT" on a proved SAT instance. Such solvers were (after checking with their authors) discarded from the official contest. However, some results on this web site still contain references to these solvers, but, please do notice that, in such cases, we only consider SAT (certified by our certificate-checker) answer of these solvers when results also use hors-concours solvers. In a few words, buggy solvers can be considered in some cases as "incomplete hors-concours" solvers in some pages of this web site. In addition, these results are only indicative and are not in the "official parts" of the results.
- We had a major conflict between the "no black box rule" and the "previous winner" rule. ForkLift was previous year winner and a black box (bad luck). So we decided to run it as an hors-concours solver only, awarding the first non-black box solvers in each category.
- In the random category, we suspect that the incomplete solvers have found all SAT benchmarks during the first stage (exactly 150 SAT benchmarks over 300... Which is (incredibly) exactly what the theory says). All formulas status were unknown at the beginning of the contest. Thus, there were probably no more SAT formula for the second stage, according to our (strict) rules. We decided, with the judges, to consider in the random category, for the second stage, that all benchmarks should enter. Thus, the TOP-N solvers (in the random category) were launched on all the benchmarks on which they failed during the first stage. This gave us the ranking for awarding the solvers in this category. Next year, the rules will change, to take this problem into account.
| Final results of the contest (June, 2003) |
And finally, after months (and may be years :-)) of suspens, the winners are:
- Industrial category
- Crafted category
- Award for the best solver on SAT benchmark: None (last year winner Satzoo by Niklas Een)
- Award for the best solver on UNSAT benchmark: March-eq (by Marijn Heule and Hans van Maaren)
- Award for the best solver on ALL (SAT+UNSAT) benchmark: March-eq (by Marijn Heule and Hans van Maaren)
- Random category
- Award for the best solver on SAT benchmark: Adaptnovelty by Holger Hoos and Dave Tompkins
- Award for the best solver on UNSAT benchmark: None (last year winner Kcnfs by Gilles Dequen and Olivier Dubois)
- Award for the best solver on ALL (SAT+UNSAT) benchmark: Adaptnovelty by Holger Hoos and Dave Tompkins
Here are the results for all the solvers that entered the second stage (last update: June, 2004): | Industrial (All) | | Solver | #Solved |
|---|
|
| zchaff_rand | 20 |
| Satzoo_1.02 | 10 |
| brchaff | 8 |
| Jerusat1.3 | 6 |
| quantor | 6 |
| CQuest | 5 |
| CirCUsH1 | 3 |
| minilearning | 3 |
| compsat | 3 |
| Industrial (SAT) | | Solver | #Solved |
|---|
|
| Jerusat1.3 | 3 |
| CirCUsH1 | 2 |
| zchaff_rand | 2 |
| brchaff | 1 |
| compsat | 1 |
| Satzoo_1.02 | 1 |
| Industrial (UNSAT) | | Solver | #Solved |
|---|
|
| zchaff_rand | 18 |
| Satzoo_1.02 | 9 |
| brchaff | 7 |
| quantor | 6 |
| CQuest | 5 |
| minilearning | 3 |
| Jerusat1.3 | 3 |
| compsat | 2 |
| CirCUsH1 | 1 |
| Crafted (ALL) | | Solver | #Solved |
|---|
| march-eq-100 | 10 | | Satzoo_1.02 | 10 | | satzilla_nr | 3 | | Jerusat1.3 | 2 | | OepirA | 2 | | brchaff | 1 | | nanosat | 1 |
| | Crafted (SAT) | | Solver | #Solved |
|---|
| Satzoo_1.02 | 2 | | brchaff | 1 | | nanosat | 1 |
|
| Crafted (UNSAT) | | Solver | #Solved |
|---|
| march-eq-100 | 10 | | Satzoo_1.02 | 8 | | satzilla_nr | 3 | | Jerusat1.3 | 2 | | OepirA | 2 |
|
| Random (ALL) | | Solver | #Solved | #New Solved |
|---|
| adaptnovelty | 150 | 7 | | saps | 148 | 4 | | walksatrnp | 145 | 3 | | gasat | 128 | 17 | | qingting | 113 | 2 | | unitwalk | 112 | 6 | | satzilla_nr | 110 | 2 | | kcnfs | 90 | 30 | | cls | 78 | 13 | | march-007 | 63 | 18 |
| | Random (SAT) | | Solver | #Solved | #New Solved |
|---|
| adaptnovelty | 150 | 7 | | saps | 148 | 4 | | walksatrnp | 145 | 3 | | GaSAT | 128 | 17 | | QingTing | 113 | 2 | | UnitWalk | 112 | 6 | | satzilla_nr | 110 | 2 | | cls | 78 | 13 | | kcnfs | 78 | 18 | | march-007 | 45 | 9 |
| | Random (UNSAT) | | Solver | #Solved | #New Solved |
|---|
| kcnfs | 26 | 12 | | march-007 | 18 | 9 |
|
| The results of the first round, sorted by solver name |
| Some nice arrays of results: |
You can see for the Random category:
You can see for the Industrial category: You can see for the Crafted category:
| Check them yourself (be a winner)! |
You can check the following benchmarks with your own solver... Just to see... They remained unsolved even after the second stage of the contest. They are the two smallest unsolved benchmarks:
The official release of the benchmarks is available! They we'll be moved to satlib asap.
You can download an array of the first phase results here to do your own analysis. You may find the slides (in pdf) of the presentation given in Vancouver.
 | © 2004 L. Simon Scripts last modified on June, 2004 File generated on 3-08-2005 |  |