Name | BinPacking/ BinPacking-tab-ft/BinPacking-tab-ft120-19.xml |
MD5SUM | 90a7b6352cefaac33401a11faadaca46 |
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 | 245.028 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 142 |
Number of constraints | 50 |
Number of domains | 2 |
Minimum domain size | 48 |
Maximum domain size | 88 |
Distribution of domain sizes | [{"size":48,"count":1},{"size":88,"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 id='sol4' type='solution' cost='6'> <list> x b[][] </list> <values> 6 499 497 0 496 492 0 491 486 0 484 250 250 479 253 250 476 254 251 472 256 251 469 255 253 468 256 251 467 257 253 460 258 253 456 260 253 450 261 254 442 265 254 434 269 257 430 269 259 426 271 259 418 276 260 418 268 267 416 270 265 410 300 271 407 309 271 405 309 275 399 301 296 395 305 298 390 315 292 390 309 281 386 321 279 381 341 275 380 331 276 380 309 277 379 309 273 374 337 273 371 319 274 369 320 272 367 340 276 364 333 288 358 333 282 352 330 291 350 330 291 345 326 296 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>