| Name | csp/travellingSalesman-20/ normalized-tsp-20-8_ext.xml |
| MD5SUM | bf163617dfabfacac1751e8d2d93f3ed |
| 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.06199 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 230 |
| Maximum constraint arity | 3 |
| Maximum domain size | 1001 |
| Number of constraints which are defined in extension | 230 |
| 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 12 12 7 11 3 14 7 6 22 10 6 20 7 13 5 16 10 17 2 7 0 9 14 3 1 5 8 18 6 15 7 1 3 4 1 8 4 19 0 19 22 29 51 57 64 69 79 81 81 95 96 104 110 117 120 121 125 125 125 0