| Name | csp/travellingSalesman-25/ normalized-tsp-25-163_ext.xml |
| MD5SUM | 3b29cce7fa484c6d0ef33e7228d1e446 |
| 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 | 30.5414 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 76 |
| Number of constraints | 350 |
| Maximum constraint arity | 3 |
| Maximum domain size | 1001 |
| Number of constraints which are defined in extension | 350 |
| 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 9 5 23 1 8 22 19 18 4 8 6 4 20 12 0 2 16 21 12 13 1 19 7 25 15 11 4 14 4 20 0 15 0 24 3 10 12 6 14 17 5 23 23 9 7 3 4 16 0 32 40 59 63 69 89 89 105 117 118 125 140 144 148 148 148 151 163 177 182 205 212 216 216 216 0