Name | TravellingSalesman/TravellingSalesman-m1-n150/ TravellingSalesman-150-50-15.xml |
MD5SUM | 97b5a288822c02a27c7c951fc8651369 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 573 |
Best CPU time to get the best result obtained on this benchmark | 1679.1 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 300 |
Number of constraints | 151 |
Number of domains | 2 |
Minimum domain size | 63 |
Maximum domain size | 150 |
Distribution of domain sizes | [{"size":63,"count":150},{"size":150,"count":150}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":150},{"degree":3,"count":150}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 150 |
Distribution of constraint arities | [{"arity":3,"count":150},{"arity":150,"count":1}] |
Number of extensional constraints | 150 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":150},{"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: 573<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] c[45] c[46] c[47] c[48] c[49] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89] c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[110] c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[120] c[121] c[122] c[123] c[124] c[125] c[126] c[127] c[128] c[129] c[130] c[131] c[132] c[133] c[134] c[135] c[136] c[137] c[138] c[139] c[140] c[141] c[142] c[143] c[144] c[145] c[146] c[147] c[148] c[149] 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] d[45] d[46] d[47] d[48] d[49] d[50] d[51] d[52] d[53] d[54] d[55] d[56] d[57] d[58] d[59] d[60] d[61] d[62] d[63] d[64] d[65] d[66] d[67] d[68] d[69] d[70] d[71] d[72] d[73] d[74] d[75] d[76] d[77] d[78] d[79] d[80] d[81] d[82] d[83] d[84] d[85] d[86] d[87] d[88] d[89] d[90] d[91] d[92] d[93] d[94] d[95] d[96] d[97] d[98] d[99] d[100] d[101] d[102] d[103] d[104] d[105] d[106] d[107] d[108] d[109] d[110] d[111] d[112] d[113] d[114] d[115] d[116] d[117] d[118] d[119] d[120] d[121] d[122] d[123] d[124] d[125] d[126] d[127] d[128] d[129] d[130] d[131] d[132] d[133] d[134] d[135] d[136] d[137] d[138] d[139] d[140] d[141] d[142] d[143] d[144] d[145] d[146] d[147] d[148] d[149] </list> <values>68 69 80 88 87 92 102 103 104 143 136 128 123 116 115 113 122 135 134 149 148 133 121 146 145 142 127 120 119 126 130 141 140 139 138 132 118 124 125 114 109 100 97 98 85 81 79 75 78 66 61 50 38 45 44 41 24 27 23 19 2 0 6 1 10 11 22 21 16 20 28 31 34 32 25 29 35 52 54 60 62 65 67 58 55 47 48 51 39 42 26 15 9 8 5 4 13 12 17 7 3 14 46 76 86 91 95 99 94 101 107 108 110 82 84 93 83 71 57 49 40 18 112 131 147 144 137 129 117 111 106 105 96 90 89 74 72 70 59 53 37 36 30 33 43 56 64 77 73 63 3 5 4 3 4 3 3 2 13 1 3 3 2 3 1 3 4 2 5 4 5 4 11 5 2 4 1 1 6 3 3 2 3 4 3 3 1 1 3 3 2 1 6 4 2 2 2 3 5 2 5 4 2 3 2 5 2 3 1 5 1 6 6 5 2 2 2 2 2 4 3 1 1 2 1 2 5 4 3 1 6 4 4 1 5 1 1 4 1 5 6 4 2 2 1 4 2 2 3 1 9 10 11 4 2 1 1 4 3 2 1 1 9 13 6 4 6 5 4 2 9 31 7 5 2 1 3 3 3 2 2 2 3 1 5 1 1 4 2 6 32 4 3 6 4 3 9 1 4 2 </values> </instantiation>