| Name | csp/travellingSalesman-25/ normalized-tsp-25-48_ext.xml |
| MD5SUM | da13ba5a9bae10f8f78b88700e630ef7 |
| 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 | 6.99794 |
| 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:4 4 24 0 17 1 11 4 1 15 16 2 2 14 23 0 20 4 21 26 15 7 9 7 5 10 6 4 8 1 13 10 10 11 12 3 25 0 19 22 18 9 3 6 22 12 7 12 14 1 4 5 9 24 26 40 40 44 70 77 84 94 98 99 109 120 123 123 145 154 160 172 184 185 185 0