CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-42.xml
MD5SUM98b0f2d64ff1a719956c3a593e5aff09
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 arity18
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-271072875SAT 0.045992 0.0530361
Mistral-prime 1.3131072886SAT 0.048991 0.053193
MDG-noprobe 2008-06-271072876SAT 0.049992 0.0564799
cpHydra k_101072891SAT 0.058991 0.059558
cpHydra k_401072892SAT 0.06299 0.071178
Mistral-option 1.3141072885SAT 0.068989 0.0760799
casper zito1072888SAT 0.239962 0.24368
casper zao1072887SAT 1.28081 1.28951
Sugar v1.13+minisat1072879SAT 1.56476 1.65677
choco2_dwdeg 2008-06-261072882SAT 1.58276 1.62426
Sugar v1.13+picosat1072878SAT 1.74273 1.85946
Abscon 112v4 AC1072889SAT 2.03569 2.09559
Abscon 112v4 ESAC1072890SAT 2.76958 2.81934
choco2_impwdeg 2008-06-261072881SAT 3.61845 3.6948
Concrete + CPS4J 2008-05-301072874SAT 135.156 135.877
bpsolver 2008-06-271072880SAT 1343.92 1350.31
Minion/Tailor 2008-07-041106630? 0.334948 0.383478
SAT4J CSP 2008-06-131072877? 686.018 667.544
galac E1072884? (problem) 119.84 121.028
galac M1072883? (problem) 119.887 120.921
Concrete + CSP4J - WMC Engine 2008-05-301072873? (TO) 1800.06 1809.12
Concrete + CSP4J - Tabu Engine 2008-05-301072872? (TO) 1800.1 1804.03

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