Name | BinPacking/BinPacking-sum-skj1/ BinPacking-sum-n1c3w4d.xml |
MD5SUM | e17d1f270cb1c92567283195f4efc493 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 8 |
Best CPU time to get the best result obtained on this benchmark | 75.319504 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 117 |
Number of constraints | 61 |
Number of domains | 2 |
Minimum domain size | 30 |
Maximum domain size | 37 |
Distribution of domain sizes | [{"size":30,"count":1},{"size":37,"count":116}] |
Minimum variable degree | 2 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":87},{"degree":5,"count":29}] |
Minimum constraint arity | 4 |
Maximum constraint arity | 116 |
Distribution of constraint arities | [{"arity":4,"count":58},{"arity":30,"count":1},{"arity":116,"count":2}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"ordered","count":29},{"type":"lex","count":1},{"type":"sum","count":29},{"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: 8<instantiation type="optimum" cost="8"> <list> x b[0][0] b[0][1] b[0][2] b[0][3] b[1][0] b[1][1] b[1][2] b[1][3] b[2][0] b[2][1] b[2][2] b[2][3] b[3][0] b[3][1] b[3][2] b[3][3] b[4][0] b[4][1] b[4][2] b[4][3] b[5][0] b[5][1] b[5][2] b[5][3] b[6][0] b[6][1] b[6][2] b[6][3] b[7][0] b[7][1] b[7][2] b[7][3] b[8][0] b[8][1] b[8][2] b[8][3] b[9][0] b[9][1] b[9][2] b[9][3] b[10][0] b[10][1] b[10][2] b[10][3] b[11][0] b[11][1] b[11][2] b[11][3] b[12][0] b[12][1] b[12][2] b[12][3] b[13][0] b[13][1] b[13][2] b[13][3] b[14][0] b[14][1] b[14][2] b[14][3] b[15][0] b[15][1] b[15][2] b[15][3] b[16][0] b[16][1] b[16][2] b[16][3] b[17][0] b[17][1] b[17][2] b[17][3] b[18][0] b[18][1] b[18][2] b[18][3] b[19][0] b[19][1] b[19][2] b[19][3] b[20][0] b[20][1] b[20][2] b[20][3] b[21][0] b[21][1] b[21][2] b[21][3] b[22][0] b[22][1] b[22][2] b[22][3] b[23][0] b[23][1] b[23][2] b[23][3] b[24][0] b[24][1] b[24][2] b[24][3] b[25][0] b[25][1] b[25][2] b[25][3] b[26][0] b[26][1] b[26][2] b[26][3] b[27][0] b[27][1] b[27][2] b[27][3] b[28][0] b[28][1] b[28][2] b[28][3] </list> <values> 8 100 48 0 0 96 54 0 0 93 56 0 0 90 58 0 0 88 61 0 0 88 58 0 0 86 61 0 0 85 64 0 0 84 58 0 0 84 44 0 0 83 67 0 0 83 47 0 0 80 70 0 0 80 36 34 0 79 37 34 0 77 40 33 0 77 40 31 0 74 43 33 0 68 41 41 0 54 51 45 0 53 49 45 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>