Name | csp/travellingSalesman-25/ normalized-tsp-25-561_ext.xml |
MD5SUM | 42884b409c3603fb2d153815b8fc2d3d |
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 | 4.07438 |
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:9 2 11 6 19 17 6 14 24 0 14 0 2 2 7 17 1 8 13 1 3 2 8 2 21 2 4 25 18 6 10 5 25 2 5 7 12 6 22 4 16 1 15 14 20 25 23 6 17 0 8 25 39 39 39 41 58 66 67 69 71 73 98 104 109 111 118 124 128 129 143 168 174 174 174 0