| Name | BinPacking/BinPacking-tab-sw120/ BinPacking-tab-sw120-75.xml |
| MD5SUM | 9cdf82428becd6b5ad716031980a59d2 |
| 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 | 2520.02 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 133 |
| Number of constraints | 25 |
| Number of domains | 2 |
| Minimum domain size | 23 |
| Maximum domain size | 47 |
| Distribution of domain sizes | [{"size":23,"count":1},{"size":47,"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 | 22 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","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 200 200 200 0 187 169 168 161 155 150 186 170 168 160 156 150 186 168 168 161 154 150 183 173 171 171 170 0 182 182 166 160 156 152 182 181 171 170 170 0 173 173 171 170 158 152 167 166 166 161 158 153 167 163 162 160 158 153 166 163 163 161 159 154 197 197 196 196 196 0 164 164 163 161 159 156 164 163 163 161 159 157 197 194 194 193 193 0 196 196 196 195 194 0 193 192 191 190 190 0 191 185 184 183 180 0 190 190 189 189 185 0 188 179 178 178 176 0 187 178 176 174 171 0 187 178 175 174 172 0 0 </values> </instantiation>