CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-2-50-23-fcd/
normalized-rand-2-50-23-587-230-fcd-22_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-50-23-fcd/
normalized-rand-2-50-23-587-230-fcd-22_ext.xml
MD5SUM1729bc579ce595de42e10a64a2efdb08
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 benchmark209.235
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints465
Maximum constraint arity2
Maximum domain size23
Number of constraints which are defined in extension465
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
Mistral-prime 1.3131102107SAT 209.235 210.583
MDG-noprobe 2008-06-271102097SAT 330.267 330.393
Mistral-option 1.3141102106SAT 356.783 359.54
MDG-probe 2008-06-271102096SAT 357.246 358.738
Concrete + CSP4J - Tabu Engine 2008-05-301102092SAT 582.538 583.068
cpHydra k_101102112SAT 597.419 600.519
cpHydra k_401102113SAT 617.2 624.394
Abscon 112v4 ESAC1102111SAT 618.702 618.967
bpsolver 2008-06-271102101SAT 653.448 656.056
choco2_impwdeg 2008-06-261102102SAT 836.053 841.509
choco2_dwdeg 2008-06-261102103SAT 853.497 856.289
Concrete + CPS4J 2008-05-301102094SAT 1017.83 1019.05
Abscon 112v4 AC1102110SAT 1216.02 1218.08
galac E1102105? (TO) 1800.04 1804.81
casper zao1102108? (TO) 1800.05 1803.41
Sugar v1.13+picosat1102099? (TO) 1800.06 1801.92
casper zito1102109? (TO) 1800.06 1816.01
galac M1102104? (TO) 1800.07 1803.01
Concrete + CSP4J - WMC Engine 2008-05-301102093? (TO) 1800.08 1807.52
spider 2008-06-141102095? (TO) 1800.1 1804.01
Minion/Tailor 2008-07-041106755? (TO) 1800.12 1809.91
Sugar v1.13+minisat1102100? (TO) 1800.13 1810.12
SAT4J CSP 2008-06-131102098? (TO) 1800.14 1816.18

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:
9 13 6 8 3 5 21 20 5 8 17 9 21 7 12 1 21 22 19 20 3 15 9 16 1 7 11 0 17 0 9 12 16 8 11 10 13 13 17 1 11 7 2 21 8 21 6 16 13 8