CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-15_ext.xml
MD5SUM28c92a68563baeb93cc40b063f84846d
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.35679
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-271096552SAT 1.35679 1.37474
Concrete + CSP4J - Tabu Engine 2008-05-301096548SAT 2.39664 2.45664
bpsolver 2008-06-271096557SAT 2.84557 2.86983
MDG-noprobe 2008-06-271096553SAT 5.05623 5.05876
Mistral-prime 1.3131096563SAT 6.15106 6.21527
galac M1096560SAT 6.38303 6.46681
Mistral-option 1.3141096562SAT 7.14491 7.21108
choco2_impwdeg 2008-06-261096558SAT 10.0215 10.0484
choco2_dwdeg 2008-06-261096559SAT 10.2104 10.3131
Abscon 112v4 AC1096566SAT 13.5729 13.6348
cpHydra k_101096568SAT 13.6349 13.8461
cpHydra k_401096569SAT 13.7369 14.0551
Abscon 112v4 ESAC1096567SAT 15.0507 15.1957
spider 2008-06-141096551SAT 16.5725 16.6049
Minion/Tailor 2008-07-041107168SAT 20.4569 20.7196
Concrete + CPS4J 2008-05-301096550SAT 21.9867 22.1328
casper zito1096565SAT 70.9902 71.0253
Sugar v1.13+minisat1096556SAT 79.3169 80.1974
galac E1096561SAT 80.3198 81.1757
SAT4J CSP 2008-06-131096554SAT 101.758 102.752
Sugar v1.13+picosat1096555SAT 130.384 131.138
casper zao1096564SAT 139.175 139.235
Concrete + CSP4J - WMC Engine 2008-05-301096549? (TO) 1800.08 1812.32

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