| Name | BinPacking/ BinPacking-mdd-ft/BinPacking-mdd-ft120-11.xml |
| MD5SUM | 7c2bd2aca8e68eed10397cff07eceed9 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 7 |
| Best CPU time to get the best result obtained on this benchmark | 249.924 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 145 |
| Number of constraints | 51 |
| Number of domains | 2 |
| Minimum domain size | 49 |
| Maximum domain size | 87 |
| Distribution of domain sizes | [{"size":49,"count":1},{"size":87,"count":144}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":96},{"degree":4,"count":48}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 144 |
| Distribution of constraint arities | [{"arity":3,"count":48},{"arity":49,"count":1},{"arity":144,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"mdd","count":48},{"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: 7<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] b[47][0] b[47][1] b[47][2] </list> <values> 7 499 493 0 493 463 0 491 491 0 488 253 251 485 253 252 483 256 252 472 257 255 465 260 256 465 258 256 456 262 256 450 264 258 449 275 250 443 266 261 443 265 261 435 273 262 429 276 262 424 277 263 422 280 264 412 281 264 408 287 266 401 325 266 400 329 268 400 313 267 400 311 268 399 320 269 395 332 268 393 326 271 385 338 275 383 337 275 378 308 288 377 310 308 377 310 288 374 305 301 372 300 291 372 296 288 365 343 292 361 347 291 360 344 296 355 350 295 354 349 297 251 251 251 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>