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 | 2400.05 |
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 id='sol1' type='solution' cost='0'> <list> x b[][] </list> <values> 0 200 200 200 200 200 0 197 197 197 196 196 0 196 196 196 196 195 0 194 194 194 193 192 0 193 193 191 191 189 0 190 190 190 190 189 0 188 187 187 187 186 0 186 185 185 184 181 0 183 183 182 182 182 0 180 179 178 178 178 0 178 176 176 159 153 150 175 174 174 172 150 150 173 173 173 160 158 158 171 171 171 167 166 154 171 171 170 163 161 161 170 169 167 163 163 162 170 168 168 168 161 154 170 166 166 160 153 152 170 166 164 164 161 159 168 161 161 160 0 0 164 163 157 156 156 152 163 163 159 158 156 155 </values> </instantiation>