| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-199.xml |
| MD5SUM | 6632ff8405f31e2dfb2c2f75c1e4c1cc |
| 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.4392 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 607 |
| Maximum domain size | 607 |
| Distribution of domain sizes | [{"size":607,"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> 179 84 401 179 160 160 160 246 353 192 353 84 0 192 0 92 246 283 246 0 411 402 401 185 0 391 338 391 378 378 397 346 263 156 246 205 346 338 300 246 246 156 263 0 422 205 0 401 391 0 </values> </instantiation>