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-34_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-34_ext.xml
MD5SUM3f58cd1a4dc6b765f25f17d9c012758b
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.029994
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints217
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension217
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.3131099753SAT 0.029994 0.0297851
MDG-noprobe 2008-06-271099743SAT 0.031994 0.0367109
cpHydra k_101099758SAT 0.041993 0.047996
cpHydra k_401099759SAT 0.041993 0.0475801
Mistral-option 1.3141099752SAT 0.074987 0.076521
casper zito1099755SAT 0.090985 0.0977871
casper zao1099754SAT 0.131979 0.143083
MDG-probe 2008-06-271099742SAT 0.232964 0.237243
spider 2008-06-141099741SAT 0.287955 0.296209
bpsolver 2008-06-271099747SAT 0.403938 0.404861
Concrete + CSP4J - Tabu Engine 2008-05-301099738SAT 0.710891 0.742239
choco2_dwdeg 2008-06-261099749SAT 0.754884 0.813652
choco2_impwdeg 2008-06-261099748SAT 0.759884 0.78875
Abscon 112v4 AC1099756SAT 0.819875 0.840742
Concrete + CPS4J 2008-05-301099740SAT 0.826873 0.854794
Minion/Tailor 2008-07-041106669SAT 0.882865 0.927068
Abscon 112v4 ESAC1099757SAT 0.884865 0.900552
Sugar v1.13+picosat1099745SAT 1.51077 1.6295
Sugar v1.13+minisat1099746SAT 1.64075 1.79057
galac E1099751SAT 2.10868 2.18428
SAT4J CSP 2008-06-131099744SAT 2.80757 2.81331
galac M1099750SAT 3.13852 3.21437
Concrete + CSP4J - WMC Engine 2008-05-301099739SAT 409.035 412.588

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:
13 2 10 5 4 1 5 0 8 14 5 13 12 4 2 8 8 8 5 2 2 5 10 1 13 0 7 7 3 8