| Name | BinPacking/BinPacking-sum-sw100/ BinPacking-sum-sw100-01.xml |
| MD5SUM | 158e2c33e228ebf79a07c013c2cd02f9 |
| 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 | 20012.7 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 109 |
| Number of constraints | 39 |
| Number of domains | 2 |
| Minimum domain size | 19 |
| Maximum domain size | 47 |
| Distribution of domain sizes | [{"size":19,"count":1},{"size":47,"count":108}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":90},{"degree":5,"count":18}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 108 |
| Distribution of constraint arities | [{"arity":6,"count":36},{"arity":19,"count":1},{"arity":108,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":18},{"type":"lex","count":1},{"type":"sum","count":18},{"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> <list>x b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] b[0][5] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[1][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] 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] </list> <values>0 200 199 179 179 174 0 200 198 197 194 193 0 200 198 197 194 192 0 191 190 188 181 181 0 191 188 159 157 152 150 191 185 180 179 177 0 190 183 183 183 175 0 189 170 167 164 155 155 187 171 169 169 152 152 187 169 167 160 158 158 186 173 172 156 156 156 185 184 179 151 151 150 185 184 177 153 150 0 185 178 171 156 156 154 184 165 165 163 162 161 182 182 182 173 171 0 177 170 163 163 163 160 177 158 156 155 154 150 </values> </instantiation>