| Name | csp/travellingSalesman-25/ normalized-tsp-25-54_ext.xml |
| MD5SUM | 5595f8aff8e667477c35af26f6ef9eca |
| 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 | 0.511921 |
| 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:16 5 19 13 14 0 15 5 1 2 24 8 6 9 9 1 11 5 12 14 2 1 22 2 20 0 5 7 23 2 7 3 8 14 10 3 25 0 21 10 4 4 13 0 3 2 17 6 18 21 18 18 23 25 33 42 43 48 62 63 65 65 72 74 77 91 94 94 104 108 108 110 116 137 137 0