CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-8-30-3-0/
normalized-radar-8-30-3-0-27.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-27.xml
MD5SUMc8ca62a6bef8c3ef16912b58424772c6
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.045992
Satisfiable
(Un)Satisfiability was proved
Number of variables180
Number of constraints64
Maximum constraint arity20
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-271072560SAT 0.045992 0.0496991
MDG-noprobe 2008-06-271072561SAT 0.048991 0.049999
Mistral-prime 1.3131072571SAT 0.05599 0.0611161
cpHydra k_401072577SAT 0.057991 0.0648511
cpHydra k_101072576SAT 0.06099 0.060686
bpsolver 2008-06-271072565SAT 0.112982 0.122138
Mistral-option 1.3141072570SAT 0.141977 0.14753
casper zito1072573SAT 0.524919 0.532466
choco2_dwdeg 2008-06-261072567SAT 1.65075 1.67242
Sugar v1.13+picosat1072563SAT 1.65075 1.76813
Sugar v1.13+minisat1072564SAT 1.65875 1.76169
Abscon 112v4 AC1072574SAT 1.9367 1.99621
casper zao1072572SAT 2.00269 2.0077
Abscon 112v4 ESAC1072575SAT 2.85656 2.91487
choco2_impwdeg 2008-06-261072566SAT 3.56346 3.60253
Minion/Tailor 2008-07-041106621? 0.335948 0.378745
galac E1072569? (problem) 142.943 144.372
galac M1072568? (problem) 146.399 147.848
Concrete + CPS4J 2008-05-301072559? (MO) 44.99 45.22
Concrete + CSP4J - WMC Engine 2008-05-301072558? (TO) 1800.01 1815.62
Concrete + CSP4J - Tabu Engine 2008-05-301072557? (TO) 1800.02 1813.82
SAT4J CSP 2008-06-131072562? (TO) 1802.31 1734.42

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