CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15/
normalized-rand-2-30-15-306-230-43_ext.xml
MD5SUM1cd3a5b3e26bd182ff178829d35e66f7
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.121981
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints227
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension227
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.3141099026SAT 0.121981 0.128
Mistral-prime 1.3131099027SAT 0.289955 0.308207
cpHydra k_401099033SAT 0.292954 0.297211
cpHydra k_101099032SAT 0.315951 0.322772
MDG-probe 2008-06-271099016SAT 0.327949 0.334472
MDG-noprobe 2008-06-271099017SAT 0.360944 0.36752
Concrete + CPS4J 2008-05-301099014SAT 0.956853 1.01307
choco2_impwdeg 2008-06-261099022SAT 1.14882 1.15623
casper zao1099028SAT 1.17682 1.19347
spider 2008-06-141099015SAT 1.19282 1.2079
choco2_dwdeg 2008-06-261099023SAT 1.20482 1.25818
Concrete + CSP4J - Tabu Engine 2008-05-301099012SAT 1.35479 1.41466
Sugar v1.13+minisat1099020SAT 1.49877 1.62775
Minion/Tailor 2008-07-041106690SAT 1.58876 1.66913
bpsolver 2008-06-271099021SAT 1.86871 1.87833
Abscon 112v4 AC1099030SAT 2.02969 2.0868
Abscon 112v4 ESAC1099031SAT 2.05669 2.08537
galac M1099024SAT 2.44763 2.54427
Sugar v1.13+picosat1099019SAT 3.64345 3.77359
galac E1099025SAT 3.80842 3.91413
SAT4J CSP 2008-06-131099018SAT 4.50031 4.51928
casper zito1099029SAT 4.86626 4.90645
Concrete + CSP4J - WMC Engine 2008-05-301099013SAT 412.766 413.477

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