| Name | csp/travellingSalesman-25/ normalized-tsp-25-66_ext.xml |
| MD5SUM | 3518e3f195ddf214ca0d283aa45732b4 |
| 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.316951 |
| 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:22 0 8 3 7 1 10 0 16 3 2 14 1 4 6 1 14 4 21 1 25 3 17 3 18 1 20 22 4 5 19 1 3 3 13 0 9 4 15 0 5 16 12 13 24 8 23 4 11 6 3 4 4 7 21 25 26 30 31 34 37 38 60 65 66 69 69 73 73 89 102 110 114 120 120 0