CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/travellingSalesman-20/
normalized-tsp-20-453_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/travellingSalesman-20/
normalized-tsp-20-453_ext.xml
MD5SUMbc159f71b70cc6572fa8c4e05332f265
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 benchmark4.48232
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints230
Maximum constraint arity3
Maximum domain size1001
Number of constraints which are defined in extension230
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 1.545 (complete)2079873SAT 4.48232 4.51373
bpsolver 09 (complete)2079874SAT 9.74052 9.74511
Abscon 112v4 ESAC (complete)2097172SAT 12.868 12.8753
Conquer 2009-07-10 (complete)2079872SAT 15.4686 15.7351
Abscon 112v4 AC (complete)2097171SAT 26.009 26.3158
Concrete 2009-07-14 (complete)2079867SAT 26.072 26.3439
Sugar v1.14.6+minisat (complete)2079871SAT 104.888 105.506
Choco2.1.1b 2009-07-16 (complete)2116497SAT 132.119 133.43
Choco2.1.1 2009-06-10 (complete)2079869SAT 145.947 146.44
Sugar v1.14.6+picosat (complete)2079870SAT 413.55 417.074
Concrete DC 2009-07-14 (complete)2079868SAT 454.054 455.678
pcs-restart 0.3.2 (complete)2079866SAT 1680.56 1687.31
SAT4J CSP 2.1.1 (complete)2079864? 806.18 807.913
pcs 0.3.2 (complete)2079865? (TO) 1800.03 1807.11

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:
6 11 11 6 10 1 20 13 4 2 14 4 8 4 19 21 7 6 12 22 16 40 1 0 18 5 17 15 2 23 3 1 9 2 5 2 13 0 15 1 17 18 31 33 37 41 62 68 90 130 130 135 150
173 174 176 178 178 179 179 0