CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.2/
normalized-rand-2-40-11-414-200-20_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-20_ext.xml
MD5SUMdb66caa45d053cc8bd868c9e5477d220
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.825874
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints414
Maximum constraint arity2
Maximum domain size11
Number of constraints which are defined in extension414
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
MDG-noprobe 2008-06-271096597SAT 0.825874 0.837939
Concrete + CSP4J - WMC Engine 2008-05-301096593SAT 0.995848 1.02072
bpsolver 2008-06-271096601SAT 2.31665 2.34442
Sugar v1.13+picosat1096599SAT 2.99054 3.1481
MDG-probe 2008-06-271096596SAT 3.36349 3.39953
Mistral-prime 1.3131096607SAT 3.80242 3.84
Mistral-option 1.3141096606SAT 4.37233 4.37673
choco2_dwdeg 2008-06-261096603SAT 8.92364 8.95525
choco2_impwdeg 2008-06-261096602SAT 9.46056 9.58629
Concrete + CSP4J - Tabu Engine 2008-05-301096592SAT 10.9503 11.0157
cpHydra k_401096613SAT 11.2783 11.5847
cpHydra k_101096612SAT 11.4143 11.5888
Sugar v1.13+minisat1096600SAT 11.5582 11.7215
Abscon 112v4 ESAC1096611SAT 16.7644 16.783
Abscon 112v4 AC1096610SAT 17.4703 17.6879
Concrete + CPS4J 2008-05-301096594SAT 17.9403 17.9853
casper zito1096609SAT 24.6652 24.6823
galac E1096605SAT 37.0674 37.5074
spider 2008-06-141096595SAT 48.6816 49.0582
galac M1096604SAT 56.5904 56.9494
casper zao1096608SAT 93.8517 94.321
Minion/Tailor 2008-07-041107169SAT 109.226 110.255
SAT4J CSP 2008-06-131096598SAT 112.755 112.982

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