CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-30-3-0/
normalized-radar-8-30-3-0-8.xml
MD5SUMe1b491ef7d7fd676efcb81a11520cf65
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.049992
Satisfiable
(Un)Satisfiability was proved
Number of variables180
Number of constraints64
Maximum constraint arity19
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.3131073012SAT 0.049992 0.0563091
MDG-noprobe 2008-06-271073002SAT 0.050992 0.0563029
cpHydra k_101073017SAT 0.055991 0.0702841
cpHydra k_401073018SAT 0.056991 0.057816
MDG-probe 2008-06-271073001SAT 0.059989 0.0601001
Mistral-option 1.3141073011SAT 0.165974 0.172949
casper zito1073014SAT 0.332949 0.346852
Sugar v1.13+minisat1073005SAT 1.46378 1.57223
casper zao1073013SAT 1.59876 1.62391
choco2_dwdeg 2008-06-261073008SAT 1.61075 1.62688
Sugar v1.13+picosat1073004SAT 1.68074 1.79701
Abscon 112v4 AC1073015SAT 2.07568 2.0933
Abscon 112v4 ESAC1073016SAT 2.39264 2.45199
choco2_impwdeg 2008-06-261073007SAT 3.47247 3.55423
Concrete + CPS4J 2008-05-301073000SAT 121.91 122.012
bpsolver 2008-06-271073006SAT 478.84 482.958
Minion/Tailor 2008-07-041106637? 0.327949 0.376976
SAT4J CSP 2008-06-131073003? 485.756 473.634
galac M1073009? (problem) 129.369 130.07
galac E1073010? (problem) 137.759 139.055
Concrete + CSP4J - WMC Engine 2008-05-301072999? (TO) 1800.06 1805.82
Concrete + CSP4J - Tabu Engine 2008-05-301072998? (TO) 1800.08 1801.42

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