CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-10-20/
normalized-composed-25-10-20-7_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-10-20/
normalized-composed-25-10-20-7_ext.xml
MD5SUM934010b0a691102aa170bde0a5524019
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.047992
Satisfiable
(Un)Satisfiability was proved
Number of variables105
Number of constraints620
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension620
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131099357SAT 0.047992 0.056215
MDG-noprobe 2008-06-271099347SAT 0.051992 0.056522
cpHydra k_101099362SAT 0.056991 0.061785
cpHydra k_401099363SAT 0.060989 0.067287
Mistral-option 1.3141099356SAT 0.066989 0.075087
spider 2008-06-141099345SAT 0.107983 0.113074
MDG-probe 2008-06-271099346SAT 0.134979 0.141382
bpsolver 2008-06-271099351SAT 0.549915 0.562583
casper zito1099359SAT 0.753885 0.759998
Minion/Tailor 2008-07-041105399SAT 0.754885 0.80673
Concrete + CSP4J - Tabu Engine 2008-05-301099342SAT 0.770882 0.788923
Concrete + CPS4J 2008-05-301099344SAT 0.787879 0.758543
Concrete + CSP4J - WMC Engine 2008-05-301099343SAT 0.797878 0.864458
choco2_dwdeg 2008-06-261099353SAT 0.845871 0.889587
Abscon 112v4 AC1099360SAT 1.02884 1.05433
choco2_impwdeg 2008-06-261099352SAT 1.07783 1.25538
Abscon 112v4 ESAC1099361SAT 1.10283 1.1976
Sugar v1.13+minisat1099350SAT 1.27481 1.38907
Sugar v1.13+picosat1099349SAT 1.73273 1.82206
casper zao1099358SAT 1.9867 2.00965
galac E1099355SAT 2.27865 2.35243
galac M1099354SAT 2.44863 2.52095
SAT4J CSP 2008-06-131099348SAT 2.99654 3.0218

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:
2 1 2 2 5 0 1 7 1 1 2 3 6 4 6 3 4 1 4 0 7 4 0 0 4 0 2 5 5 8 0 0 0 2 2 0 0 3 0 9 5 7 0 3 9 1 0 4 5 4 3 2 0 3 5 9 3 5 2 7 3 0 1 8 5 8 5 0 2 3
0 1 7 8 6 3 0 0 4 4 9 0 0 4 4 0 2 4 9 9 7 4 1 0 0 3 1 0 9 2 1 4 0 1 8