CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-49.xml
MD5SUMab941f5036b03c1644708da5a40a9e9d
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.047992
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-271073022SAT 0.047992 0.0544811
Mistral-prime 1.3131073033SAT 0.054991 0.0555359
Mistral-option 1.3141073032SAT 0.06199 0.0621119
MDG-noprobe 2008-06-271073023SAT 0.068988 0.0752181
cpHydra k_401073039SAT 0.082987 0.0926361
cpHydra k_101073038SAT 0.083987 0.091263
bpsolver 2008-06-271073027SAT 0.102983 0.103085
casper zito1073035SAT 0.39194 0.393618
choco2_dwdeg 2008-06-261073029SAT 1.61975 1.67437
Sugar v1.13+minisat1073026SAT 1.62275 1.66376
Sugar v1.13+picosat1073025SAT 1.65775 1.7913
casper zao1073034SAT 1.71474 1.71606
Abscon 112v4 AC1073036SAT 1.71574 1.52113
choco2_impwdeg 2008-06-261073028SAT 4.10738 3.84087
Abscon 112v4 ESAC1073037SAT 11.2473 11.0352
Concrete + CPS4J 2008-05-301073021SAT 135.782 136.47
Minion/Tailor 2008-07-041106633? 0.330949 0.378045
SAT4J CSP 2008-06-131073024? 578.127 560.595
galac E1073031? (problem) 107.38 107.329
galac M1073030? (problem) 111.347 112.474
Concrete + CSP4J - Tabu Engine 2008-05-301073019? (TO) 1800.03 1823.42
Concrete + CSP4J - WMC Engine 2008-05-301073020? (TO) 1800.09 1802.62

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