CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-8-24-3-2/
normalized-radar-8-24-3-2-49.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-49.xml
MD5SUM5a269cdd0c4336fdf593ff6a0c261d29
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.037993
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints64
Maximum constraint arity16
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension64
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-probe 2008-06-271080764SAT 0.037993 0.042471
Mistral-prime 1.3131080775SAT 0.038993 0.0454721
MDG-noprobe 2008-06-271080765SAT 0.040992 0.0411481
Mistral-option 1.3141080774SAT 0.040993 0.047299
cpHydra k_401080781SAT 0.048992 0.0584031
cpHydra k_101080780SAT 0.052991 0.0579111
bpsolver 2008-06-271080769SAT 0.088986 0.096877
casper zito1080777SAT 0.099984 0.107819
casper zao1080776SAT 0.736887 0.751034
Sugar v1.13+minisat1080768SAT 1.19882 1.32042
Sugar v1.13+picosat1080767SAT 1.3208 1.35124
choco2_dwdeg 2008-06-261080771SAT 1.3238 1.36562
choco2_impwdeg 2008-06-261080770SAT 1.84672 1.88317
Abscon 112v4 AC1080778SAT 4.90325 4.97048
Abscon 112v4 ESAC1080779SAT 7.03293 7.15268
Concrete + CPS4J 2008-05-301080763SAT 133.473 139.457
Concrete + CSP4J - Tabu Engine 2008-05-301080761SAT 241.039 242.306
Minion/Tailor 2008-07-041106609? 0.359944 0.384705
galac E1080773? (problem) 145.905 146.862
galac M1080772? (problem) 149.863 151.205
Concrete + CSP4J - WMC Engine 2008-05-301080762? (TO) 1800.09 1815.42
SAT4J CSP 2008-06-131080766? (TO) 1802.35 1736.44

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 1 0 0 0 0 1 3 2 0 1 2 1 2 0 0 1 1 1 2 3 2 1 0 1 0 0 3 1 2 0 0 2 2 1 0 1 0 1 1 0 1 0 0 3 3 2 3 0 0 2 3 3 1 0 0 0 0 0 0 2 0 0 0 1 0 1 0
0 0 3 0 2 0 1 0 3 0 1 2 1 0 0 1 0 0 3 3 3 0 0 0 1 0 1 0 3 1 0 0 3 3 0 1 0 0 3 0 0 0 0 3 3 0 0 0 0 0 3 2 0 0 1 2 0 0 0 0 2 1 3 1 0 0 3 1 0 2
0 0 3 1