Name | BinPacking/ BinPacking-mdd-ft/BinPacking-mdd-ft120-13.xml |
MD5SUM | f538aabc6a41aa561e8cda6eca1a34a0 |
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 | 244.45599 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 145 |
Number of constraints | 51 |
Number of domains | 2 |
Minimum domain size | 49 |
Maximum domain size | 88 |
Distribution of domain sizes | [{"size":49,"count":1},{"size":88,"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 id='sol8' type='solution' cost='7'> <list> x b[][] </list> <values> 7 491 477 0 473 472 0 467 464 0 461 265 253 459 267 251 459 261 250 458 263 250 454 263 254 448 266 255 444 266 255 440 267 255 426 272 255 423 273 256 417 291 258 416 297 261 414 318 256 413 313 259 408 290 267 407 287 268 406 295 265 404 314 263 400 321 261 399 322 264 397 317 269 391 315 270 387 290 273 384 309 302 384 305 305 378 337 273 378 329 278 375 350 275 375 334 278 375 330 274 372 324 290 370 341 278 361 354 280 360 355 283 359 356 283 356 329 291 356 323 299 356 323 297 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>