CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-2-30-15-fcd/
normalized-rand-2-30-15-306-230-fcd-42_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15-fcd/
normalized-rand-2-30-15-306-230-fcd-42_ext.xml
MD5SUM5702d1cca2e8648dd8b0a2ed0bbe4dc7
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.203968
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints216
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension216
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-option 1.3141099378SAT 0.203968 0.216957
MDG-noprobe 2008-06-271099369SAT 0.382941 0.393926
Mistral-prime 1.3131099379SAT 0.398938 0.405547
cpHydra k_401099385SAT 0.409937 0.421416
cpHydra k_101099384SAT 0.409937 0.415753
MDG-probe 2008-06-271099368SAT 0.613906 0.621083
Abscon 112v4 AC1099382SAT 0.885865 0.940307
Abscon 112v4 ESAC1099383SAT 1.01384 1.09421
Concrete + CSP4J - Tabu Engine 2008-05-301099364SAT 1.06884 1.10747
bpsolver 2008-06-271099373SAT 1.21481 1.23054
Sugar v1.13+minisat1099372SAT 1.71874 1.81652
Concrete + CPS4J 2008-05-301099366SAT 1.84372 1.8882
Sugar v1.13+picosat1099371SAT 2.78458 2.85833
choco2_dwdeg 2008-06-261099375SAT 2.99954 3.0795
choco2_impwdeg 2008-06-261099374SAT 3.15552 3.2197
galac E1099377SAT 3.9274 4.02059
spider 2008-06-141099367SAT 4.47132 4.49985
Minion/Tailor 2008-07-041106672SAT 7.33788 7.41357
SAT4J CSP 2008-06-131099370SAT 8.32573 8.31193
casper zito1099381SAT 10.0115 10.0193
galac M1099376SAT 10.0135 10.1784
casper zao1099380SAT 78.5171 78.9097
Concrete + CSP4J - WMC Engine 2008-05-301099365? (TO) 1800.08 1810.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:
5 3 3 8 0 10 5 8 4 8 2 2 5 12 11 2 6 0 13 14 5 11 7 3 8 6 10 2 4 4