CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-27.xml
MD5SUMcc07c0c823ab5d6cc2bd13553116745a
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.043992
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
Mistral-prime 1.3131080691SAT 0.043992 0.050277
MDG-probe 2008-06-271080680SAT 0.043992 0.050499
MDG-noprobe 2008-06-271080681SAT 0.043993 0.05148
Mistral-option 1.3141080690SAT 0.048992 0.054992
cpHydra k_101080696SAT 0.05699 0.0636531
cpHydra k_401080697SAT 0.05799 0.0636809
bpsolver 2008-06-271080685SAT 0.089985 0.100311
casper zito1080693SAT 0.108982 0.108347
casper zao1080692SAT 0.799877 0.814238
Sugar v1.13+minisat1080684SAT 1.44678 1.61372
choco2_dwdeg 2008-06-261080687SAT 1.55076 1.57897
Sugar v1.13+picosat1080683SAT 1.63075 1.76846
choco2_impwdeg 2008-06-261080686SAT 2.15267 2.19129
Abscon 112v4 AC1080694SAT 3.49247 3.54283
Abscon 112v4 ESAC1080695SAT 3.70844 3.76278
Concrete + CPS4J 2008-05-301080679SAT 124.316 124.395
Minion/Tailor 2008-07-041106600? 0.373942 0.39707
galac E1080689? (problem) 115.985 117.769
galac M1080688? (problem) 119.797 120.979
Concrete + CSP4J - WMC Engine 2008-05-301080678? (TO) 1800 1804.92
Concrete + CSP4J - Tabu Engine 2008-05-301080677? (TO) 1800.04 1801.22
SAT4J CSP 2008-06-131080682? (TO) 1802.22 1745.64

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