Qualification

There will be two qualification rounds for registered solvers, where successful participation in at least one of them is mandatory to be accredited for SAT-Race.

In each round, we check the following requirements:

Requirements

  • Conformance to I/O specification. Solvers have to respect the I/O requirements. In particular, the output must contain a solution line (starting with "s ") and—in case of a satisfiable instance—at least one values line (starting with "v "). Exit codes also must be set correctly (10 for satisfiable, 20 for unsatisfiable, 0 for unknown).
  • Correctness of results. The solvers are not allowed to produce wrong answers (e.g. 'satisfiable' for an unsatisfiable instance, but of course they may time-out).
  • Sufficient performance. Solvers must meet some minimal speed requirements. We will set the level of required performance particularly high for the first qualification round to stimulate improvement of solvers.

Cheating (e.g. pre-computing results) is not allowed. We will check all solvers on additional instances, and fraudulent solvers will be disqualified (the organizing committee will decide on this).

Dates

The dead-lines for the qualification rounds are May 17 for the first one, and June 16 for the second one.

First Qualification Round

The first qualification round has taken place on and after May 17. Each solver had to tackle all 50 instances of the first benchmark test set. In contrast to the SAT-Race itself, the run-time limit was set to 20 minutes per solver and instance. Solvers which were able to solve at least 40 instances are already qualified for SAT-Race 2006. These solvers are:

SolverSubmitterAffiliation #Solved
Eureka Alexander Nadel Intel 45
RsatThammanit PipatsrisawatUCLA 45
Bsat (BarcelogicTools)Robert Nieuwenhuis Technical University Catalonia, Barcelona43
Actin (minisat+i)Raihan KibriaTU Darmstadt 43
TinisatJinbo HuangNational ICT Australia 41
zChaffZhaohui FuPrinceton University 41

Second Qualification Round

The second qualification has taken place on and after June 16. Each solver had to tackle all 50 instances of the second benchmark test set. In contrast to the SAT-Race itself, the run-time limit was set to 20 minutes per solver and instance. Solvers that participated successfully—and thus are qualified for SAT-Race 2006—are:

SolverSubmitterAffiliation #SolvedScore
Actin (minisat+i) Raihan Kibria TU Darmstadt 39 46.91
MiniSAT 2.0 betaNiklas Sörensson Chalmers University, Gothenburg3946.63
picosatArmin BiereJKU Linz 3843.92
Cadence MiniSATNiklas EénCadence 3642.61
RsatThammanit PipatsrisawatUCLA 3541.25
qpicosatArmin BiereJKU Linz 3440.24
TinisatJinbo HuangNational ICT Australia 3440.20
sat4jDaniel Le BerreCRIL-CNRS 3034.60
qcompsatArmin BiereJKU Linz 2933.84
compsat15Armin BiereJKU Linz 2630.71
mxcDavid MitchellSimon Fraser University 2326.76
mucsatNicolas RachinskyLMU Munich 2022.91
HsatDomagoj BabicUniversity of British Columbia 2022.51

The scores have been calculated using the scoring scheme described on the Rules page. These 13 solvers, besides the three solvers that already qualified in the first round and did not participate in the second, are now qualified for SAT-Race 2006.