| Name | BinPacking/BinPacking-sum-skj2/ BinPacking-sum-n1w1b1r5.xml |
| MD5SUM | 15a2bddfb10fd8a6157ce871797528b8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 3.29172 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 43 |
| Number of domains | 2 |
| Minimum domain size | 21 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":21,"count":1},{"size":42,"count":60}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":40},{"degree":5,"count":20}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":3,"count":40},{"arity":21,"count":1},{"arity":60,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":20},{"type":"lex","count":1},{"type":"sum","count":20},{"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: 3<instantiation type='solution' cost='3'> <list>b[0][0] b[0][1] b[0][2] b[10][0] b[10][1] b[10][2] b[11][0] b[11][1] b[11][2] b[12][0] b[12][1] b[12][2] b[13][0] b[13][1] b[13][2] b[14][0] b[14][1] b[14][2] b[15][0] b[15][1] b[15][2] b[16][0] b[16][1] b[16][2] b[17][0] b[17][1] b[17][2] b[18][0] b[18][1] b[18][2] b[19][0] b[19][1] b[19][2] b[1][0] b[1][1] b[1][2] b[2][0] b[2][1] b[2][2] b[3][0] b[3][1] b[3][2] b[4][0] b[4][1] b[4][2] b[5][0] b[5][1] b[5][2] b[6][0] b[6][1] b[6][2] b[7][0] b[7][1] b[7][2] b[8][0] b[8][1] b[8][2] b[9][0] b[9][1] b[9][2] x </list> <values>394 333 0 368 326 302 365 335 299 356 333 291 356 321 281 355 321 278 354 332 287 348 326 324 0 0 0 0 0 0 0 0 0 392 339 266 391 342 267 386 338 274 383 337 279 382 312 305 380 317 303 370 278 274 369 318 281 368 326 304 3 </values> </instantiation>