| Name | csp/travellingSalesman-25/ normalized-tsp-25-456_ext.xml |
| MD5SUM | 4f093d71afd3d07bae8a17fc0aeadbfd |
| 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 | 46.001 |
| 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:2 17 19 4 20 5 24 11 13 14 8 6 3 0 21 13 7 1 5 1 9 18 6 1 10 22 15 5 25 0 17 5 23 10 4 3 16 1 18 9 22 12 12 6 11 7 1 10 14 9 21 26 37 51 57 57 70 71 72 90 91 113 118 118 123 133 136 137 146 158 164 171 181 190 190 0