CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/modifiedRenault/
normalized-renault-mod-31_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/modifiedRenault/
normalized-renault-mod-31_ext.xml
MD5SUMda411ae17296d3ddbd6ba5ccd8b25a14
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.640902
Satisfiable
(Un)Satisfiability was proved
Number of variables111
Number of constraints154
Maximum constraint arity10
Maximum domain size42
Number of constraints which are defined in extension154
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271073957SAT 0.640902 0.650949
cpHydra k_401073973SAT 0.660899 0.665194
Mistral-prime 1.3131073967SAT 0.702892 0.708376
cpHydra k_101073972SAT 0.708891 0.72015
mddc-solv 2008-06-091073954SAT 1.05384 1.05699
spider 2008-06-141073955SAT 1.53177 1.54745
Mistral-option 1.3141073966SAT 1.85372 1.85573
Abscon 112v4 AC1073970SAT 1.88871 1.92129
MDG-probe 2008-06-271073956SAT 1.90571 1.92635
Abscon 112v4 ESAC1073971SAT 2.31265 2.36793
Minion/Tailor 2008-07-041106034SAT 5.2512 5.15823
choco2_dwdeg 2008-06-261073963SAT 5.45817 5.53715
Sugar v1.13+minisat1073960SAT 7.32389 7.42355
choco2_impwdeg 2008-06-261073962SAT 8.20275 8.30391
Sugar v1.13+picosat1073959SAT 8.39472 8.53092
casper zito1073969SAT 9.76251 9.81283
galac M1073964SAT 12.1382 12.3601
galac E1073965SAT 12.974 13.1124
casper zao1073968SAT 38.0582 38.505
Concrete + CPS4J 2008-05-301073953SAT 153.486 154.346
Concrete + CSP4J - Tabu Engine 2008-05-301073951SAT 843.105 843.448
bpsolver 2008-06-271073961SAT 1356.4 1366.18
SAT4J CSP 2008-06-131073958? 73.5248 71.13
Concrete + CSP4J - WMC Engine 2008-05-301073952? (TO) 1800.03 1808.52

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
0 1 0 5 1 0 0 3 1 1 1 0 0 1 0 1 0 0 1 2 2 1 1 1 20 0 3 0 0 0 1 0 6 1 0 0 0 0 1 2 0 0 0 1 2 0 1 0 1 0 1 1 1 1 1 1 1 1 1 0 1 0 1 0 1 1 2 0 1 2
0 4 1 1 5 0 0 1 0 1 4 1 2 0 1 0 1 0 0 0 0 0 0 0 0 2 3 1 0 0 2 2 5 8 6 6 3 2 0 0 1