CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-38.xml
MD5SUMc0a8aec87bdd5cd737932cfa7db7395c
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.048991
Satisfiable
(Un)Satisfiability was proved
Number of variables180
Number of constraints64
Maximum constraint arity21
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.3131072781SAT 0.048991 0.057207
MDG-noprobe 2008-06-271072771SAT 0.052991 0.0594331
MDG-probe 2008-06-271072770SAT 0.059989 0.0711259
cpHydra k_101072786SAT 0.064989 0.0713419
cpHydra k_401072787SAT 0.065989 0.065676
Mistral-option 1.3141072780SAT 0.065989 0.07234
bpsolver 2008-06-271072775SAT 0.107982 0.117119
casper zito1072783SAT 0.607906 0.608027
Sugar v1.13+minisat1072774SAT 1.38579 1.43491
choco2_dwdeg 2008-06-261072777SAT 1.57476 1.6214
Sugar v1.13+picosat1072773SAT 1.63075 1.74086
Abscon 112v4 ESAC1072785SAT 1.79673 1.6277
Abscon 112v4 AC1072784SAT 1.9407 1.99669
casper zao1072782SAT 2.6126 2.63796
choco2_impwdeg 2008-06-261072776SAT 4.03339 4.12566
Concrete + CPS4J 2008-05-301072769SAT 136.024 136.761
Minion/Tailor 2008-07-041106628? 0.308952 0.563953
galac M1072778? (problem) 133.289 134.613
galac E1072779? (problem) 133.344 134.635
Concrete + CSP4J - WMC Engine 2008-05-301072768? (TO) 1800.05 1812.73
Concrete + CSP4J - Tabu Engine 2008-05-301072767? (TO) 1800.06 1807.72
SAT4J CSP 2008-06-131072772? (TO) 1802.29 1728.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 0 3 0 0 0 0 0 3 2 0 0 0 0 0 3 0 1 1 0 0 0 1 0 0 0 0 2 0 0 0 0 1 0 3 0 0 0 0 0 0 0 1 0 1 0 0 1 2 0 1 0 0 2 1 0 0 1 2 2 0 0 0 0 3 2 3 3 3
3 2 0 0 1 0 3 1 0 0 0 0 0 0 0 0 0 0 3 0 3 0 0 0 0 0 0 0 0 1 2 0 0 0 0 0 3 3 0 0 0 1 0 3 0 0 0 1 1 0 0 0 3 1 2 0 3 0 0 1 2 3 0 0 1 1 0 1 0 0
2 1 3 0 0 0 2 1 3 0 2 3 2 0 1 2 0 1 1 0 3 0 3 0 0 0 0 0 0 0 0 0 2 2 0 1 0 0 2 0