CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-30-15/
normalized-rand-2-30-15-306-230-45_ext.xml
MD5SUM6bacebfd0df854210bf259a68500d2e4
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.095985
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints226
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension226
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.3131099225SAT 0.095985 0.0976139
cpHydra k_401099231SAT 0.109982 0.119048
cpHydra k_101099230SAT 0.109983 0.117543
MDG-noprobe 2008-06-271099215SAT 0.146977 0.152822
Mistral-option 1.3141099224SAT 0.196969 0.203777
MDG-probe 2008-06-271099214SAT 0.292955 0.299415
bpsolver 2008-06-271099219SAT 0.451931 0.456973
Abscon 112v4 ESAC1099229SAT 0.934857 0.993526
spider 2008-06-141099213SAT 0.97885 0.995536
Abscon 112v4 AC1099228SAT 0.998848 1.05802
Concrete + CSP4J - Tabu Engine 2008-05-301099210SAT 1.08583 1.01126
choco2_impwdeg 2008-06-261099220SAT 1.3078 1.4532
Concrete + CPS4J 2008-05-301099212SAT 1.3158 1.27205
choco2_dwdeg 2008-06-261099221SAT 1.3368 1.36222
Minion/Tailor 2008-07-041106691SAT 1.57276 1.63869
Sugar v1.13+picosat1099217SAT 1.76073 1.91931
casper zito1099227SAT 1.86272 1.87306
Sugar v1.13+minisat1099218SAT 2.18967 2.3389
galac E1099223SAT 2.33864 2.41359
galac M1099222SAT 2.44863 2.57539
casper zao1099226SAT 3.09953 3.11899
SAT4J CSP 2008-06-131099216SAT 3.20751 2.88677
Concrete + CSP4J - WMC Engine 2008-05-301099211SAT 7.71783 7.7354

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