CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-10-20/
normalized-composed-25-10-20-2_ext.xml
MD5SUMfaf7b6ed5b982ece342417b300053655
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.051991
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.3131099291SAT 0.051991 0.051811
MDG-noprobe 2008-06-271099281SAT 0.05799 0.064177
Mistral-option 1.3141099290SAT 0.061989 0.0642561
cpHydra k_401099297SAT 0.064989 0.0668849
cpHydra k_101099296SAT 0.067988 0.0749561
MDG-probe 2008-06-271099280SAT 0.083986 0.088662
spider 2008-06-141099279SAT 0.120981 0.128859
casper zito1099293SAT 0.613906 0.625743
bpsolver 2008-06-271099285SAT 0.636902 0.652543
Concrete + CPS4J 2008-05-301099278SAT 0.723889 0.785496
Concrete + CSP4J - WMC Engine 2008-05-301099277SAT 0.757884 0.745206
Minion/Tailor 2008-07-041105395SAT 0.785879 0.838139
Concrete + CSP4J - Tabu Engine 2008-05-301099276SAT 0.787879 0.845182
choco2_impwdeg 2008-06-261099286SAT 0.843871 0.885555
Abscon 112v4 AC1099294SAT 1.04384 1.10362
choco2_dwdeg 2008-06-261099287SAT 1.06184 1.09307
Abscon 112v4 ESAC1099295SAT 1.10783 1.15144
Sugar v1.13+minisat1099284SAT 1.18582 1.31597
Sugar v1.13+picosat1099283SAT 1.3378 1.31351
casper zao1099292SAT 1.48577 1.51093
galac M1099288SAT 2.32965 2.38853
galac E1099289SAT 2.41863 2.42446
SAT4J CSP 2008-06-131099282SAT 2.77358 2.79497

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