CSP 2009 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/travellingSalesman-20/
normalized-tsp-20-727_ext.xml
MD5SUMaeaf793ca70a0fb576c3a82ca5483bb5
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 benchmark1.57076
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
Abscon 112v4 AC (complete)2097185SAT 1.57076 1.51589
Abscon 112v4 ESAC (complete)2097186SAT 1.57476 1.6238
Mistral 1.545 (complete)2079950SAT 2.6026 2.676
Conquer 2009-07-10 (complete)2079949SAT 3.36849 3.58402
Concrete 2009-07-14 (complete)2079944SAT 4.36134 4.43319
Choco2.1.1b 2009-07-16 (complete)2116504SAT 17.7513 17.8622
Choco2.1.1 2009-06-10 (complete)2079946SAT 20.5619 20.8065
bpsolver 09 (complete)2079951SAT 23.8864 24.0996
Concrete DC 2009-07-14 (complete)2079945SAT 141.909 143.285
Sugar v1.14.6+minisat (complete)2079948SAT 152.25 152.981
Sugar v1.14.6+picosat (complete)2079947SAT 297.915 300.863
pcs 0.3.2 (complete)2079942SAT 377.647 379.899
pcs-restart 0.3.2 (complete)2079943SAT 504.243 504.623
SAT4J CSP 2.1.1 (complete)2079941? 402.033 402.187

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:
19 21 13 3 5 6 9 1 10 23 2 4 8 28 1 12 7 27 12 8 18 12 14 13 11 4 6 23 3 5 20 9 15 3 16 5 17 4 4 4 24 30 31 54 58 86 98 125 133 145 158 162
185 190 199 202 207 211 215 215 0