| Name | TravellingSalesman/TravellingSalesman-m1-n100/ TravellingSalesman-100-50-08.xml |
| MD5SUM | 8e11a97c7673f129a8c4890bd1c1105b |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 443 |
| Best CPU time to get the best result obtained on this benchmark | 240.02901 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 101 |
| Number of domains | 2 |
| Minimum domain size | 62 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":62,"count":100},{"size":100,"count":100}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":100},{"degree":3,"count":100}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":3,"count":100},{"arity":100,"count":1}] |
| Number of extensional constraints | 100 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":100},{"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: 443<instantiation type='solution' cost='-443'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[3] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] c[4] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[5] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[6] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[7] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89] c[8] c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[3] d[40] d[41] d[42] d[43] d[44] d[45] d[46] d[47] d[48] d[49] d[4] d[50] d[51] d[52] d[53] d[54] d[55] d[56] d[57] d[58] d[59] d[5] d[60] d[61] d[62] d[63] d[64] d[65] d[66] d[67] d[68] d[69] d[6] d[70] d[71] d[72] d[73] d[74] d[75] d[76] d[77] d[78] d[79] d[7] d[80] d[81] d[82] d[83] d[84] d[85] d[86] d[87] d[88] d[89] d[8] d[90] d[91] d[92] d[93] d[94] d[95] d[96] d[97] d[98] d[99] d[9] </list> <values>23 59 65 68 61 64 67 71 63 58 52 33 46 40 41 81 86 90 91 95 82 79 43 83 75 72 92 96 97 99 87 93 94 48 98 88 89 85 84 78 74 70 69 77 50 73 76 80 57 51 38 39 44 56 45 54 34 31 30 14 1 0 2 11 17 21 55 27 15 12 16 6 3 8 10 20 19 62 32 35 36 47 49 53 42 37 28 22 66 13 9 7 4 5 18 25 24 26 29 60 5 9 2 4 4 1 2 4 4 4 3 5 2 1 18 6 4 9 2 7 1 3 3 2 5 15 5 2 1 4 2 1 1 1 3 5 5 2 4 2 2 2 5 9 1 4 3 14 4 5 7 2 4 4 6 1 3 2 7 19 30 5 6 2 2 4 5 5 1 1 5 2 4 4 8 2 7 2 1 1 7 1 2 6 6 6 3 5 7 6 3 1 4 7 3 1 2 4 4 1 </values> </instantiation>