| Name | BinPacking/ BinPacking-tab-ft/BinPacking-tab-ft120-15.xml |
| MD5SUM | 3d6808b330f5ae5835187fa3c31c3257 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 6 |
| Best CPU time to get the best result obtained on this benchmark | 247.696 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 142 |
| Number of constraints | 50 |
| Number of domains | 2 |
| Minimum domain size | 48 |
| Maximum domain size | 82 |
| Distribution of domain sizes | [{"size":48,"count":1},{"size":82,"count":141}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":94},{"degree":4,"count":47}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 141 |
| Distribution of constraint arities | [{"arity":3,"count":47},{"arity":48,"count":1},{"arity":141,"count":2}] |
| Number of extensional constraints | 47 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":47},{"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: 6<instantiation> <list> x b[0][0] b[0][1] b[0][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] 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[20][0] b[20][1] b[20][2] b[21][0] b[21][1] b[21][2] b[22][0] b[22][1] b[22][2] b[23][0] b[23][1] b[23][2] b[24][0] b[24][1] b[24][2] b[25][0] b[25][1] b[25][2] b[26][0] b[26][1] b[26][2] b[27][0] b[27][1] b[27][2] b[28][0] b[28][1] b[28][2] b[29][0] b[29][1] b[29][2] b[30][0] b[30][1] b[30][2] b[31][0] b[31][1] b[31][2] b[32][0] b[32][1] b[32][2] b[33][0] b[33][1] b[33][2] b[34][0] b[34][1] b[34][2] b[35][0] b[35][1] b[35][2] b[36][0] b[36][1] b[36][2] b[37][0] b[37][1] b[37][2] b[38][0] b[38][1] b[38][2] b[39][0] b[39][1] b[39][2] b[40][0] b[40][1] b[40][2] b[41][0] b[41][1] b[41][2] b[42][0] b[42][1] b[42][2] b[43][0] b[43][1] b[43][2] b[44][0] b[44][1] b[44][2] b[45][0] b[45][1] b[45][2] b[46][0] b[46][1] b[46][2] </list> <values> 6 487 484 0 483 251 251 482 446 0 479 256 251 473 258 251 472 425 0 472 258 252 469 262 252 465 264 255 463 264 255 458 267 256 453 269 257 446 271 260 443 271 262 443 270 261 443 270 261 440 276 263 433 272 266 426 287 267 426 285 267 422 294 266 411 304 270 408 303 274 404 306 274 400 310 277 400 307 274 387 332 278 387 330 277 386 334 279 386 333 279 378 317 292 373 306 302 372 322 296 367 320 303 365 322 303 363 357 280 363 337 296 363 322 305 362 354 282 362 344 281 250 250 250 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>