| Name | BinPacking/ BinPacking-tab-ft/BinPacking-tab-ft060-06.xml |
| MD5SUM | 765e7641190fc685f39512b7809eb6f8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 243.576 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 73 |
| Number of constraints | 27 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 52 |
| Distribution of domain sizes | [{"size":25,"count":1},{"size":52,"count":72}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":48},{"degree":4,"count":24}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 72 |
| Distribution of constraint arities | [{"arity":3,"count":24},{"arity":25,"count":1},{"arity":72,"count":2}] |
| Number of extensional constraints | 24 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":24},{"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: 3<instantiation id='sol4' type='solution' cost='3'> <list> x b[][] </list> <values> 3 498 485 0 471 464 0 451 450 0 449 273 250 427 281 250 424 279 250 405 297 252 403 292 252 400 278 269 394 276 274 388 287 259 380 339 253 375 317 262 374 344 261 374 321 276 369 310 275 368 337 265 365 300 275 357 322 276 355 322 284 328 304 284 0 0 0 0 0 0 0 0 0 </values> </instantiation>