CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-29.xml
MD5SUMbca19a4f2def118903392a7d6a10cfcf
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.047991
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-271072707SAT 0.047991 0.0548801
Mistral-prime 1.3131072718SAT 0.048992 0.049383
MDG-noprobe 2008-06-271072708SAT 0.051991 0.0581061
cpHydra k_101072723SAT 0.06299 0.0692901
cpHydra k_401072724SAT 0.06399 0.0702619
bpsolver 2008-06-271072712SAT 0.096984 0.0969411
Mistral-option 1.3141072717SAT 0.18997 0.197887
casper zito1072720SAT 0.426934 0.431333
Sugar v1.13+minisat1072711SAT 1.39479 1.44852
Sugar v1.13+picosat1072710SAT 1.62375 1.70431
choco2_dwdeg 2008-06-261072714SAT 1.81672 1.88913
casper zao1072719SAT 1.99369 2.01677
Abscon 112v4 AC1072721SAT 2.6166 2.66154
Abscon 112v4 ESAC1072722SAT 2.65459 2.72475
choco2_impwdeg 2008-06-261072713SAT 3.36049 3.4457
Concrete + CPS4J 2008-05-301072706SAT 130.549 130.641
Minion/Tailor 2008-07-041106623? 0.372942 0.397342
galac M1072715? (problem) 128.659 129.837
galac E1072716? (problem) 134.43 135.129
Concrete + CSP4J - Tabu Engine 2008-05-301072704? (TO) 1800.04 1802.32
Concrete + CSP4J - WMC Engine 2008-05-301072705? (TO) 1800.09 1810.54
SAT4J CSP 2008-06-131072709? (TO) 1802.4 1745.23

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