| Name | csp/travellingSalesman-25/ normalized-tsp-25-13_ext.xml |
| MD5SUM | eef28a8aaa5ab23398c7f7cc139b9a88 |
| 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.600908 |
| 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 3 7 6 23 2 18 6 20 11 19 6 9 3 24 1 13 5 8 12 2 5 11 4 25 0 1 4 3 12 5 19 21 13 17 1 10 2 12 4 14 2 6 3 22 0 4 2 15 7 9 11 17 28 34 37 38 43 55 60 64 64 68 80 99 112 113 115 119 121 124 124 126 133 133 0