| Name | BinPacking/BinPacking-sum-skj2/ BinPacking-sum-n2w4b2r1.xml |
| MD5SUM | a404c513102fb879343dc63e509eedd5 |
| 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.44 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 166 |
| Number of constraints | 25 |
| Number of domains | 2 |
| Minimum domain size | 12 |
| Maximum domain size | 70 |
| Distribution of domain sizes | [{"size":12,"count":1},{"size":70,"count":165}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":154},{"degree":5,"count":11}] |
| Minimum constraint arity | 12 |
| Maximum constraint arity | 165 |
| Distribution of constraint arities | [{"arity":12,"count":1},{"arity":15,"count":22},{"arity":165,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":11},{"type":"lex","count":1},{"type":"sum","count":11},{"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[0][6] b[0][7] b[0][8] b[0][9] b[0][10] b[0][11] b[0][12] b[0][13] b[0][14] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[1][5] b[1][6] b[1][7] b[1][8] b[1][9] b[1][10] b[1][11] b[1][12] b[1][13] b[1][14] b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] b[2][5] b[2][6] b[2][7] b[2][8] b[2][9] b[2][10] b[2][11] b[2][12] b[2][13] b[2][14] b[3][0] b[3][1] b[3][2] b[3][3] b[3][4] b[3][5] b[3][6] b[3][7] b[3][8] b[3][9] b[3][10] b[3][11] b[3][12] b[3][13] b[3][14] b[4][0] b[4][1] b[4][2] b[4][3] b[4][4] b[4][5] b[4][6] b[4][7] b[4][8] b[4][9] b[4][10] b[4][11] b[4][12] b[4][13] b[4][14] b[5][0] b[5][1] b[5][2] b[5][3] b[5][4] b[5][5] b[5][6] b[5][7] b[5][8] b[5][9] b[5][10] b[5][11] b[5][12] b[5][13] b[5][14] b[6][0] b[6][1] b[6][2] b[6][3] b[6][4] b[6][5] b[6][6] b[6][7] b[6][8] b[6][9] b[6][10] b[6][11] b[6][12] b[6][13] b[6][14] b[7][0] b[7][1] b[7][2] b[7][3] b[7][4] b[7][5] b[7][6] b[7][7] b[7][8] b[7][9] b[7][10] b[7][11] b[7][12] b[7][13] b[7][14] b[8][0] b[8][1] b[8][2] b[8][3] b[8][4] b[8][5] b[8][6] b[8][7] b[8][8] b[8][9] b[8][10] b[8][11] b[8][12] b[8][13] b[8][14] b[9][0] b[9][1] b[9][2] b[9][3] b[9][4] b[9][5] b[9][6] b[9][7] b[9][8] b[9][9] b[9][10] b[9][11] b[9][12] b[9][13] b[9][14] b[10][0] b[10][1] b[10][2] b[10][3] b[10][4] b[10][5] b[10][6] b[10][7] b[10][8] b[10][9] b[10][10] b[10][11] b[10][12] b[10][13] b[10][14] </list> <values>0 165 154 150 150 123 85 82 74 0 0 0 0 0 0 0 165 154 150 147 113 85 84 83 0 0 0 0 0 0 0 164 70 68 67 67 67 65 65 62 61 61 61 61 59 0 160 155 113 111 108 102 85 84 82 0 0 0 0 0 0 159 131 125 121 116 115 115 114 0 0 0 0 0 0 0 157 100 96 95 95 94 94 92 91 86 0 0 0 0 0 153 146 144 134 131 127 86 78 0 0 0 0 0 0 0 143 131 130 129 128 116 113 103 0 0 0 0 0 0 0 140 118 107 102 101 94 80 79 76 74 0 0 0 0 0 139 138 138 137 135 111 109 93 0 0 0 0 0 0 0 103 97 90 89 86 86 71 66 60 0 0 0 0 0 0 </values> </instantiation>