CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-32_ext.xml
MD5SUM44435c4e170248de88e14f41eec9160b
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.55176
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-271096618SAT 1.55176 1.56848
Concrete + CSP4J - Tabu Engine 2008-05-301096614SAT 2.25966 2.30359
galac E1096627SAT 3.07453 3.15108
Sugar v1.13+minisat1096622SAT 3.71243 3.87284
Mistral-option 1.3141096628SAT 4.6273 4.67564
MDG-noprobe 2008-06-271096619SAT 5.39618 5.43998
Mistral-prime 1.3131096629SAT 5.56515 5.61324
bpsolver 2008-06-271096623SAT 6.25205 6.30491
galac M1096626SAT 7.97279 8.16348
Sugar v1.13+picosat1096621SAT 11.9352 12.1676
cpHydra k_401096635SAT 12.6131 12.8453
cpHydra k_101096634SAT 13.251 13.4449
Abscon 112v4 AC1096632SAT 16.1215 16.1828
casper zao1096630SAT 16.9584 17.1205
Concrete + CPS4J 2008-05-301096616SAT 17.0244 17.2028
casper zito1096631SAT 17.0364 17.1132
Abscon 112v4 ESAC1096633SAT 17.8253 18.0023
choco2_dwdeg 2008-06-261096625SAT 19.908 19.9298
choco2_impwdeg 2008-06-261096624SAT 21.6647 21.8735
spider 2008-06-141096617SAT 22.2306 22.4163
Minion/Tailor 2008-07-041107173SAT 44.8342 45.3114
SAT4J CSP 2008-06-131096620SAT 105.554 105.61
Concrete + CSP4J - WMC Engine 2008-05-301096615? (TO) 1800.08 1802.12

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