| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-183.xml |
| MD5SUM | a94c8ce581cdc830ec36047aa81438de |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 17.7062 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 556 |
| Maximum domain size | 556 |
| Distribution of domain sizes | [{"size":556,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":48},{"degree":3,"count":1},{"degree":4,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":1,"count":51},{"arity":2,"count":1},{"arity":50,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 52 |
| Distribution of constraint types | [{"type":"intension","count":52},{"type":"noOverlap","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> y[] x[] </list> <values> 269 269 372 254 193 189 254 193 320 281 212 227 272 320 140 140 0 227 227 189 385 372 0 355 0 348 351 158 348 348 367 363 314 355 351 348 303 303 303 314 227 227 158 0 390 0 171 367 355 0 </values> </instantiation>