| Name | csp/travellingSalesman-20/ normalized-tsp-20-30_ext.xml |
| MD5SUM | 90be3b55b88ef8a1b3d0242fef77e8ed |
| 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.083986 |
| 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:7 15 12 2 20 18 1 1 8 1 11 8 4 4 19 1 3 1 14 3 18 13 2 1 16 5 13 2 17 17 6 5 10 14 15 26 9 2 5 5 17 35 36 37 45 49 50 51 54 67 68 73 75 92 97 111 137 139 144 144 0