| Name | csp/travellingSalesman-25/ normalized-tsp-25-190_ext.xml |
| MD5SUM | 11abc635dddb5c8195ce87ef959e164c |
| 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 | 8.24175 |
| 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:14 14 19 9 25 1 10 0 20 4 3 18 18 4 5 16 23 4 22 3 9 8 21 4 6 7 16 4 7 9 13 8 12 1 24 0 11 12 15 2 2 1 4 13 1 0 8 8 17 22 23 24 24 28 46 50 66 70 73 81 85 92 96 105 113 114 114 126 128 129 142 142 150 172 172 0