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-22_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-22_ext.xml
MD5SUMad69ec6e57a2a5797b438f9a5d7133d6
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.128979
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints223
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension223
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.3141099576SAT 0.128979 0.130274
Mistral-prime 1.3131099577SAT 0.130979 0.142985
cpHydra k_401099583SAT 0.134978 0.138475
cpHydra k_101099582SAT 0.146977 0.152118
MDG-noprobe 2008-06-271099567SAT 0.18897 0.19023
spider 2008-06-141099565SAT 0.295954 0.304477
MDG-probe 2008-06-271099566SAT 0.352945 0.370847
bpsolver 2008-06-271099571SAT 0.501922 0.506867
Concrete + CSP4J - WMC Engine 2008-05-301099563SAT 0.633903 0.687056
Concrete + CSP4J - Tabu Engine 2008-05-301099562SAT 0.647901 0.680707
casper zito1099579SAT 0.715891 0.724749
Abscon 112v4 AC1099580SAT 0.98385 1.04228
Concrete + CPS4J 2008-05-301099564SAT 1.10383 1.15132
choco2_dwdeg 2008-06-261099573SAT 1.12583 1.1483
choco2_impwdeg 2008-06-261099572SAT 1.14182 1.20185
Abscon 112v4 ESAC1099581SAT 1.17582 1.21413
Sugar v1.13+minisat1099570SAT 1.54676 1.6127
casper zao1099578SAT 1.68074 1.68262
Sugar v1.13+picosat1099569SAT 1.91871 2.04368
galac M1099574SAT 2.19767 2.28204
Minion/Tailor 2008-07-041106662SAT 2.21866 2.26773
galac E1099575SAT 2.34864 2.42879
SAT4J CSP 2008-06-131099568SAT 3.24151 3.31144

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