CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.35/
normalized-rand-2-40-16-250-350-64_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.35/
normalized-rand-2-40-16-250-350-64_ext.xml
MD5SUM9176eba9f5c38264a403efbef35c3d11
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 benchmark3.13452
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints250
Maximum constraint arity2
Maximum domain size16
Number of constraints which are defined in extension250
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
bpsolver 2008-06-271097657SAT 3.13452 3.16853
MDG-noprobe 2008-06-271097653SAT 3.19151 3.20896
Mistral-prime 1.3131097663SAT 3.39448 3.40837
Mistral-option 1.3141097662SAT 3.86641 3.87878
MDG-probe 2008-06-271097652SAT 4.21236 4.25063
Concrete + CSP4J - Tabu Engine 2008-05-301097648SAT 6.72298 6.82732
choco2_impwdeg 2008-06-261097658SAT 8.64568 8.76618
choco2_dwdeg 2008-06-261097659SAT 8.76467 8.87277
Concrete + CPS4J 2008-05-301097650SAT 10.6954 10.8264
cpHydra k_101097668SAT 11.0323 11.2389
cpHydra k_401097669SAT 11.4223 11.6839
Abscon 112v4 ESAC1097667SAT 14.3408 14.4853
Abscon 112v4 AC1097666SAT 14.8747 15.0287
Minion/Tailor 2008-07-041107190SAT 18.8651 19.059
Sugar v1.13+minisat1097656SAT 30.2884 30.3907
galac E1097661SAT 44.1223 44.594
spider 2008-06-141097651SAT 47.8127 47.8428
Sugar v1.13+picosat1097655SAT 61.6776 62.3784
SAT4J CSP 2008-06-131097654SAT 70.1483 70.7716
casper zito1097665SAT 99.1209 100.076
casper zao1097664SAT 104.793 105.684
galac M1097660SAT 156.017 157.377
Concrete + CSP4J - WMC Engine 2008-05-301097649? (TO) 1800.08 1812.83

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