| Name | csp/travellingSalesman-25/ normalized-tsp-25-38_ext.xml |
| MD5SUM | b1cd667c35ed5ba4931e06993e78bd10 |
| 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 | 1.24981 |
| 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:18 5 19 5 16 16 17 10 11 3 13 29 12 1 21 5 20 1 4 3 9 1 25 6 15 5 3 0 22 4 8 6 6 14 10 8 5 3 23 4 2 1 14 4 7 2 1 2 24 2 10 26 36 39 68 69 74 75 78 79 85 90 90 94 100 114 122 125 129 130 134 136 138 140 140 0