| Name | TravellingSalesman/TravellingSalesman-m1-n45/ TravellingSalesman-45-30-04.xml |
| MD5SUM | 5907a24d8dc1871b0962636261677367 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 164 |
| Best CPU time to get the best result obtained on this benchmark | 248.763 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 34 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":34,"count":45},{"size":45,"count":45}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":45},{"degree":3,"count":45}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 45 |
| Distribution of constraint arities | [{"arity":3,"count":45},{"arity":45,"count":1}] |
| Number of extensional constraints | 45 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":45},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 164<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[40] c[41] c[42] c[43] c[44] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[40] d[41] d[42] d[43] d[44] </list> <values> 6 2 11 10 9 13 18 23 32 35 37 36 39 38 34 30 31 26 20 17 19 8 5 0 3 15 16 21 24 28 25 22 33 41 44 42 43 40 29 27 14 12 7 4 1 4 3 2 2 4 5 4 5 2 1 5 2 3 3 2 3 3 4 2 1 7 2 3 4 6 4 4 3 4 3 2 6 4 4 9 7 4 6 2 8 3 1 1 3 4 </values> </instantiation>