CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.1/
normalized-rand-2-40-8-753-100-41_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.1/
normalized-rand-2-40-8-753-100-41_ext.xml
MD5SUM4dd43aac82b802e72f6e490f7493d104
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.133979
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints752
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension752
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.3131102569SAT 0.133979 0.140866
cpHydra k_401102575SAT 0.146977 0.153661
cpHydra k_101102574SAT 0.147977 0.161815
MDG-noprobe 2008-06-271102559SAT 0.165974 0.172211
MDG-probe 2008-06-271102558SAT 0.483925 0.496545
choco2_impwdeg 2008-06-261102564SAT 1.26081 1.30056
choco2_dwdeg 2008-06-261102565SAT 1.56176 1.62469
casper zao1102570SAT 2.36664 2.39236
Mistral-option 1.3141102568SAT 2.75558 2.7669
spider 2008-06-141102557SAT 3.05353 3.08129
casper zito1102571SAT 3.14752 3.17686
Abscon 112v4 ESAC1102573SAT 4.95825 4.98945
Abscon 112v4 AC1102572SAT 5.72813 5.84416
Sugar v1.13+minisat1102562SAT 6.20206 6.41669
Minion/Tailor 2008-07-041107154SAT 6.94894 7.06426
Concrete + CPS4J 2008-05-301102556SAT 7.2019 7.29673
Concrete + CSP4J - Tabu Engine 2008-05-301102554SAT 7.75682 7.79129
bpsolver 2008-06-271102563SAT 12.3341 12.4498
SAT4J CSP 2008-06-131102560SAT 13.6839 13.729
Sugar v1.13+picosat1102561SAT 21.2408 21.6095
galac E1102567SAT 36.3485 36.7582
galac M1102566SAT 56.7714 57.1208
Concrete + CSP4J - WMC Engine 2008-05-301102555? (TO) 1800.01 1806.52

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:
6 0 4 6 4 0 1 5 1 2 2 7 6 3 2 1 0 6 6 6 3 2 7 7 6 2 5 0 3 2 3 0 4 4 0 3 4 6 6 1