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-28_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-28_ext.xml
MD5SUMec781a072a02060aef2e2d280481e767
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.074988
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints212
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension212
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.3131099687SAT 0.074988 0.080342
cpHydra k_401099693SAT 0.086986 0.0928619
cpHydra k_101099692SAT 0.086986 0.620075
MDG-probe 2008-06-271099676SAT 0.090985 0.0976239
MDG-noprobe 2008-06-271099677SAT 0.270958 0.27792
Mistral-option 1.3141099686SAT 0.286955 0.287521
bpsolver 2008-06-271099681SAT 0.720889 0.732304
Concrete + CSP4J - WMC Engine 2008-05-301099673SAT 0.723889 0.758015
Concrete + CPS4J 2008-05-301099674SAT 0.78188 0.804335
casper zito1099689SAT 0.791878 0.806178
Concrete + CSP4J - Tabu Engine 2008-05-301099672SAT 0.895863 0.946943
Minion/Tailor 2008-07-041106665SAT 1.17982 1.21228
Sugar v1.13+picosat1099679SAT 1.3448 1.46689
Sugar v1.13+minisat1099680SAT 1.49577 1.61555
spider 2008-06-141099675SAT 1.84272 1.85982
choco2_dwdeg 2008-06-261099683SAT 2.11868 2.1936
choco2_impwdeg 2008-06-261099682SAT 2.18867 2.24731
galac E1099685SAT 2.47662 2.54305
Abscon 112v4 ESAC1099691SAT 2.86456 2.92147
Abscon 112v4 AC1099690SAT 3.16152 3.22987
galac M1099684SAT 3.54546 3.62679
casper zao1099688SAT 4.25835 4.30075
SAT4J CSP 2008-06-131099678SAT 5.54916 5.61197

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