CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-2-40-19-fcd/
normalized-rand-2-40-19-443-230-fcd-33_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-2-40-19-fcd/
normalized-rand-2-40-19-443-230-fcd-33_ext.xml
MD5SUMdac92aee527e7948249532822b4b37f5
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 benchmark6.79397
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints333
Maximum constraint arity2
Maximum domain size19
Number of constraints which are defined in extension333
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-option 1.3141101490SAT 6.79397 6.86362
MDG-probe 2008-06-271101480SAT 8.77267 8.77825
Mistral-prime 1.3131101491SAT 22.9795 23.1619
MDG-noprobe 2008-06-271101481SAT 24.6143 25.1569
Concrete + CSP4J - Tabu Engine 2008-05-301101476SAT 29.7535 30.0802
cpHydra k_101101496SAT 32.2741 32.566
Abscon 112v4 ESAC1101495SAT 121.146 122.349
cpHydra k_401101497SAT 125.938 126.267
Abscon 112v4 AC1101494SAT 128.027 129.197
casper zito1101493SAT 171.885 173.509
bpsolver 2008-06-271101485SAT 173.808 175.315
Concrete + CPS4J 2008-05-301101478SAT 269.358 271.68
galac M1101488SAT 316.184 319.289
choco2_dwdeg 2008-06-261101487SAT 333.071 333.942
choco2_impwdeg 2008-06-261101486SAT 336.449 336.613
spider 2008-06-141101479SAT 362.272 365.09
casper zao1101492SAT 754.349 759.785
Concrete + CSP4J - WMC Engine 2008-05-301101477? (TO) 1800.04 1800.73
galac E1101489? (TO) 1800.05 1810.31
Sugar v1.13+picosat1101483? (TO) 1800.07 1810.92
Minion/Tailor 2008-07-041106710? (TO) 1800.08 1810.21
Sugar v1.13+minisat1101484? (TO) 1800.09 1807.33
SAT4J CSP 2008-06-131101482? (TO) 1800.18 1808.78

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