| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-160.xml |
| MD5SUM | 3ff67dee7a06e1e6311de3a7585abde9 |
| 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 | 146.729 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 53 |
| Number of domains | 1 |
| Minimum domain size | 534 |
| Maximum domain size | 534 |
| Distribution of domain sizes | [{"size":534,"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> 209 81 345 193 345 193 220 149 209 149 149 149 81 0 258 0 94 210 0 210 201 363 360 345 0 315 427 360 271 153 288 288 271 326 375 315 210 359 359 288 440 427 153 210 0 375 0 360 171 0 </values> </instantiation>