CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.2/
normalized-rand-2-40-11-414-200-27_ext.xml
MD5SUM1c49affb34b5a1ce84e17edd601c3b33
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.705892
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-271096508SAT 0.705892 0.707794
Abscon 112v4 ESAC1096523SAT 0.972851 0.998259
Abscon 112v4 AC1096522SAT 1.07683 1.15318
Concrete + CSP4J - Tabu Engine 2008-05-301096504SAT 1.67974 1.7391
Mistral-option 1.3141096518SAT 2.20466 2.20779
bpsolver 2008-06-271096513SAT 2.33065 2.33402
Sugar v1.13+picosat1096511SAT 2.78458 2.86161
MDG-noprobe 2008-06-271096509SAT 3.36449 3.40082
Mistral-prime 1.3131096519SAT 4.00039 4.03613
galac E1096517SAT 5.59815 5.68112
Sugar v1.13+minisat1096512SAT 5.76512 5.93205
choco2_dwdeg 2008-06-261096515SAT 7.2169 7.23866
choco2_impwdeg 2008-06-261096514SAT 7.2369 7.28581
Concrete + CPS4J 2008-05-301096506SAT 8.95864 9.06714
cpHydra k_101096524SAT 11.2673 11.4244
cpHydra k_401096525SAT 11.7962 12.0371
SAT4J CSP 2008-06-131096510SAT 15.4856 15.6936
galac M1096516SAT 16.1955 16.4662
casper zito1096521SAT 21.6747 21.7626
Minion/Tailor 2008-07-041107171SAT 36.4295 36.5984
spider 2008-06-141096507SAT 40.6448 40.8381
casper zao1096520SAT 113.902 114.984
Concrete + CSP4J - WMC Engine 2008-05-301096505? (TO) 1800 1803.72

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