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-29_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-29_ext.xml
MD5SUMce8a382854798010abbc032dc32c340d
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.287955
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints225
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension225
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.3141099774SAT 0.287955 0.288656
MDG-noprobe 2008-06-271099765SAT 0.327949 0.334725
Mistral-prime 1.3131099775SAT 0.38694 0.393316
cpHydra k_101099780SAT 0.401938 0.406853
cpHydra k_401099781SAT 0.403937 0.411106
MDG-probe 2008-06-271099764SAT 0.750885 0.7629
Abscon 112v4 ESAC1099779SAT 0.868867 0.885117
Abscon 112v4 AC1099778SAT 0.901862 0.938313
Concrete + CPS4J 2008-05-301099762SAT 1.17482 1.21944
bpsolver 2008-06-271099769SAT 1.22081 1.24213
Sugar v1.13+minisat1099768SAT 1.85972 1.98762
Concrete + CSP4J - Tabu Engine 2008-05-301099760SAT 2.12668 2.19349
choco2_impwdeg 2008-06-261099770SAT 2.36564 2.40892
galac E1099773SAT 2.41263 2.47033
choco2_dwdeg 2008-06-261099771SAT 2.49762 2.55984
casper zito1099777SAT 4.35434 4.40425
Sugar v1.13+picosat1099767SAT 4.49631 4.64805
spider 2008-06-141099763SAT 4.84326 4.8448
galac M1099772SAT 5.02224 5.12415
casper zao1099776SAT 5.76312 5.76648
Minion/Tailor 2008-07-041106666SAT 8.66668 8.81786
SAT4J CSP 2008-06-131099766SAT 11.1073 11.2718
Concrete + CSP4J - WMC Engine 2008-05-301099761? (TO) 1800.08 1817.23

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 14 0 13 0 13 4 9 6 14 8 7 6 13 4 8 1 4 7 14 2 8 6 0 0 7 7 10 3 9