CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-71_ext.xml
MD5SUM3f8c719670016fa8cf06ded0586a474a
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 benchmark2.32965
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-probe 2008-06-271096706SAT 2.32965 2.34126
bpsolver 2008-06-271096711SAT 5.99109 6.05006
MDG-noprobe 2008-06-271096707SAT 6.554 6.58771
Mistral-prime 1.3131096717SAT 6.77897 6.84749
Mistral-option 1.3141096716SAT 8.37373 8.37851
Abscon 112v4 AC1096720SAT 12.2541 12.3347
Abscon 112v4 ESAC1096721SAT 12.6451 12.8058
cpHydra k_101096722SAT 13.254 13.3846
cpHydra k_401096723SAT 14.2388 14.5394
Concrete + CSP4J - Tabu Engine 2008-05-301096702SAT 18.3872 18.4844
choco2_dwdeg 2008-06-261096713SAT 20.01 20.0329
choco2_impwdeg 2008-06-261096712SAT 22.1286 22.2965
galac M1096714SAT 22.5046 22.6893
Sugar v1.13+picosat1096709SAT 26.8589 27.0941
Concrete + CPS4J 2008-05-301096704SAT 34.0118 34.3508
Sugar v1.13+minisat1096710SAT 50.0454 50.3561
spider 2008-06-141096705SAT 52.851 53.306
casper zito1096719SAT 75.7675 75.9574
galac E1096715SAT 90.9212 91.4688
casper zao1096718SAT 96.8993 97.3893
Minion/Tailor 2008-07-041107177SAT 252.57 255.038
SAT4J CSP 2008-06-131096708SAT 614.04 617.676
Concrete + CSP4J - WMC Engine 2008-05-301096703? (TO) 1800.09 1811.62

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