| Name | BinPacking/BinPacking-mdd-sw120/ BinPacking-mdd-sw120-30.xml |
| MD5SUM | 1730b431530ce221acf4898e37ce65f9 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 240.03101 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 133 |
| Number of constraints | 25 |
| Number of domains | 2 |
| Minimum domain size | 23 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":23,"count":1},{"size":45,"count":132}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":110},{"degree":4,"count":22}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 132 |
| Distribution of constraint arities | [{"arity":6,"count":22},{"arity":23,"count":1},{"arity":132,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"mdd","count":22},{"type":"lex","count":1},{"type":"count","count":1},{"type":"cardinality","count":1}] |
| Optimization problem | YES |
| Type of objective | max VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0<instantiation type='solution' cost='0'> <list>b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] b[0][5] b[10][0] b[10][1] b[10][2] b[10][3] b[10][4] b[10][5] b[11][0] b[11][1] b[11][2] b[11][3] b[11][4] b[11][5] b[12][0] b[12][1] b[12][2] b[12][3] b[12][4] b[12][5] b[13][0] b[13][1] b[13][2] b[13][3] b[13][4] b[13][5] b[14][0] b[14][1] b[14][2] b[14][3] b[14][4] b[14][5] b[15][0] b[15][1] b[15][2] b[15][3] b[15][4] b[15][5] b[16][0] b[16][1] b[16][2] b[16][3] b[16][4] b[16][5] b[17][0] b[17][1] b[17][2] b[17][3] b[17][4] b[17][5] b[18][0] b[18][1] b[18][2] b[18][3] b[18][4] b[18][5] b[19][0] b[19][1] b[19][2] b[19][3] b[19][4] b[19][5] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[1][5] b[20][0] b[20][1] b[20][2] b[20][3] b[20][4] b[20][5] b[21][0] b[21][1] b[21][2] b[21][3] b[21][4] b[21][5] b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] b[2][5] b[3][0] b[3][1] b[3][2] b[3][3] b[3][4] b[3][5] b[4][0] b[4][1] b[4][2] b[4][3] b[4][4] b[4][5] b[5][0] b[5][1] b[5][2] b[5][3] b[5][4] b[5][5] b[6][0] b[6][1] b[6][2] b[6][3] b[6][4] b[6][5] b[7][0] b[7][1] b[7][2] b[7][3] b[7][4] b[7][5] b[8][0] b[8][1] b[8][2] b[8][3] b[8][4] b[8][5] b[9][0] b[9][1] b[9][2] b[9][3] b[9][4] b[9][5] x </list> <values>200 200 199 199 198 0 188 188 186 185 185 0 187 167 167 160 155 153 186 171 162 162 156 153 185 172 163 162 154 150 184 184 183 183 181 0 184 174 163 159 155 150 182 180 177 177 177 0 181 180 180 180 180 0 181 170 164 158 157 154 180 168 167 161 155 151 198 198 194 193 190 0 176 176 175 175 174 0 176 175 175 0 0 0 196 195 195 194 190 0 194 173 164 160 155 150 194 171 166 160 155 150 193 172 164 160 155 151 193 171 162 159 157 154 193 169 162 159 158 154 193 168 167 161 155 150 190 190 189 189 189 0 0 </values> </instantiation>