Name | BinPacking/ BinPacking-tab-ft/BinPacking-tab-ft120-10.xml |
MD5SUM | 742286b199079809b66c62b35b32659a |
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 | 245.119 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 145 |
Number of constraints | 51 |
Number of domains | 2 |
Minimum domain size | 49 |
Maximum domain size | 84 |
Distribution of domain sizes | [{"size":49,"count":1},{"size":84,"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 | 48 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","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='sol7' type='solution' cost='7'> <list> x b[][] </list> <values> 7 495 495 0 492 491 0 488 479 0 478 251 250 474 254 250 471 255 251 462 264 251 459 265 251 452 266 253 442 269 255 441 269 254 438 272 255 436 272 257 427 287 257 426 277 263 425 292 257 421 303 257 421 281 265 421 273 262 415 300 258 408 306 258 407 306 258 407 294 266 402 305 268 390 298 270 390 297 269 385 312 279 385 308 298 383 316 297 378 339 282 377 346 276 376 345 274 368 329 287 362 330 284 361 324 292 356 352 282 355 342 285 355 339 287 355 315 297 352 319 301 346 320 305 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>