| Name | csp/travellingSalesman-20/ normalized-tsp-20-193_ext.xml |
| MD5SUM | d791dec87b10526615a0084f40824770 |
| Bench Category | N-ARY-EXT (n-ary constraints in extension) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 2.55161 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 230 |
| Maximum constraint arity | 3 |
| Maximum domain size | 1001 |
| Number of constraints which are defined in extension | 230 |
| Number of constraints which are defined in intension | 0 |
| Global constraints used (with number of constraints) |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
Solution found:7 5 20 24 13 7 19 7 15 29 11 1 16 6 2 0 10 19 6 10 14 19 4 15 17 1 9 6 18 0 8 15 3 2 5 7 12 1 1 35 29 36 43 72 73 79 79 98 108 127 142 143 149 149 164 166 173 174 209 209 0