CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-8-20-5/
normalized-rand-8-20-5-18-800-6_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-8-20-5/
normalized-rand-8-20-5-18-800-6_ext.xml
MD5SUM3888b994eade183d2e4ca8097fc27fc8
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.20621
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints18
Maximum constraint arity8
Maximum domain size5
Number of constraints which are defined in extension18
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
mddc-solv 2008-06-091084874SAT 5.20621 5.26345
Mistral-option 1.3141084886SAT 12.4341 12.5548
MDG-probe 2008-06-271084876SAT 12.8191 12.9399
MDG-noprobe 2008-06-271084877SAT 12.925 12.9859
Mistral-prime 1.3131084887SAT 12.961 12.9709
cpHydra k_101084892SAT 24.5483 24.8685
Concrete + CPS4J 2008-05-301084873SAT 56.4974 57.0455
spider 2008-06-141084875SAT 83.5083 84.2821
Concrete + CSP4J - Tabu Engine 2008-05-301084871SAT 111.337 111.915
Minion/Tailor 2008-07-041106968SAT 138.349 139.096
Abscon 112v4 ESAC1084891SAT 144.273 144.398
Abscon 112v4 AC1084890SAT 172.82 173.654
cpHydra k_401084893SAT 182.17 184.675
Concrete + CSP4J - WMC Engine 2008-05-301084872SAT 1005.2 1011.67
SAT4J CSP 2008-06-131084878? 78.673 77.655
bpsolver 2008-06-271084881? (problem) 122.392 123.417
Sugar v1.13+picosat1084879? (MO) 12.58 12.836
Sugar v1.13+minisat1084880? (MO) 12.8179 13.7603
galac E1084885? (TO) 1800.01 1809.31
casper zito1084889? (TO) 1800.03 1808.33
casper zao1084888? (TO) 1800.08 1805.23
galac M1084884? (TO) 1800.1 1806.22
choco2_impwdeg 2008-06-261084882? (TO) 1800.13 1812.81
choco2_dwdeg 2008-06-261084883? (TO) 1800.18 1805.1

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 0 2 3 3 2 1 4 2 3 1 1 4 1 3 2 3 2 1 3