CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.1/
normalized-rand-2-40-8-753-100-0_ext.xml
MD5SUM8312805528db685104c254cf200ca446
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 benchmark1.9747
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints753
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension753
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
Abscon 112v4 ESAC1102463SAT 1.9747 2.03419
Abscon 112v4 AC1102462SAT 2.01869 2.08484
MDG-probe 2008-06-271102448SAT 2.27965 2.30371
Concrete + CSP4J - Tabu Engine 2008-05-301102444SAT 2.53461 2.57751
Mistral-prime 1.3131102459SAT 3.40948 3.42705
MDG-noprobe 2008-06-271102449SAT 3.82242 3.87365
Mistral-option 1.3141102458SAT 3.9184 3.95697
galac M1102456SAT 4.01639 4.14543
galac E1102457SAT 5.78312 5.89043
bpsolver 2008-06-271102453SAT 6.00809 6.06511
Concrete + CPS4J 2008-05-301102446SAT 6.90495 6.98857
cpHydra k_101102464SAT 10.5914 10.6753
cpHydra k_401102465SAT 11.2113 11.4665
choco2_dwdeg 2008-06-261102455SAT 11.2953 11.4399
choco2_impwdeg 2008-06-261102454SAT 12.2781 12.4116
Sugar v1.13+minisat1102452SAT 12.6501 12.7708
casper zito1102461SAT 15.6166 15.8688
spider 2008-06-141102447SAT 16.4865 16.6482
Minion/Tailor 2008-07-041107151SAT 26.7089 27.0045
Sugar v1.13+picosat1102451SAT 29.2336 29.6121
casper zao1102460SAT 85.343 85.7741
SAT4J CSP 2008-06-131102450SAT 194.043 196.11
Concrete + CSP4J - WMC Engine 2008-05-301102445? (TO) 1800.09 1810.02

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