CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-3-20-20-fcd/
normalized-rand-3-20-20-60-632-fcd-21_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20-fcd/
normalized-rand-3-20-20-60-632-fcd-21_ext.xml
MD5SUM97369210ec8c098429d86baf3771a497
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark5.50816
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints58
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension58
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.3131078129SAT 5.50816 5.559
MDG-noprobe 2008-06-271078119SAT 6.42802 6.48457
Mistral-option 1.3141078128SAT 7.8688 7.90675
mddc-solv 2008-06-091078116SAT 9.97248 9.97456
Concrete + CPS4J 2008-05-301078115SAT 11.8362 11.9408
cpHydra k_101078134SAT 12.3621 12.4989
cpHydra k_401078135SAT 13.7899 14.0551
MDG-probe 2008-06-271078118SAT 15.3757 15.5097
spider 2008-06-141078117SAT 26.27 26.527
Sugar v1.13+minisat1078122SAT 47.0269 47.1442
SAT4J CSP 2008-06-131078120SAT 48.8346 49.3692
Minion/Tailor 2008-07-041106804SAT 73.0799 73.8579
Sugar v1.13+picosat1078121SAT 87.4257 88.3954
bpsolver 2008-06-271078123SAT 88.4316 89.1183
Abscon 112v4 ESAC1078133SAT 234.117 234.297
Abscon 112v4 AC1078132SAT 243.896 246.265
choco2_dwdeg 2008-06-261078125SAT 253.851 256.16
casper zito1078131SAT 315.284 316.635
galac M1078126SAT 348.738 352.369
Concrete + CSP4J - Tabu Engine 2008-05-301078113SAT 1111.2 1116.67
galac E1078127SAT 1117.14 1119.94
casper zao1078130SAT 1129.95 1140.77
Concrete + CSP4J - WMC Engine 2008-05-301078114? (TO) 1800 1812.92
choco2_impwdeg 2008-06-261078124? (TO) 1800.12 1805.38

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:
3 5 0 15 13 18 4 10 2 1 3 3 6 7 18 12 17 16 15 0