| Name | csp/travellingSalesman-25/ normalized-tsp-25-3_ext.xml |
| MD5SUM | 9f83499fcd97050db5bc646d81ebf564 |
| 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.956853 |
| 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:13 2 11 12 4 1 6 2 9 4 1 11 2 14 14 18 20 1 22 1 7 0 24 14 5 12 12 8 18 2 23 2 15 7 16 9 25 10 10 4 8 2 17 2 21 8 19 2 3 0 14 15 17 21 32 46 64 65 66 66 80 92 100 102 104 111 120 130 134 136 138 146 148 148 148 0