| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-142.xml |
| MD5SUM | 216ebd1a5dc9377e08f238421ffc41cf |
| 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 | 46.3348 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 465 |
| Maximum domain size | 465 |
| Distribution of domain sizes | [{"size":465,"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> 225 201 212 312 212 180 201 231 225 180 127 256 137 137 127 210 201 201 201 0 0 326 312 292 0 19 383 19 153 0 32 32 0 25 0 0 0 328 392 53 383 292 56 167 0 328 153 0 292 127 </values> </instantiation>