| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-033.xml |
| MD5SUM | 273a3a450a7af16ef80dfed9e1af494c |
| 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 | 36.4974 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 51 |
| Number of domains | 1 |
| Minimum domain size | 288 |
| Maximum domain size | 288 |
| Distribution of domain sizes | [{"size":288,"count":48}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":46},{"degree":3,"count":1},{"degree":4,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 48 |
| Distribution of constraint arities | [{"arity":1,"count":49},{"arity":2,"count":1},{"arity":48,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 50 |
| Distribution of constraint types | [{"type":"intension","count":50},{"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> 129 129 120 131 201 120 56 141 73 136 95 131 95 56 159 0 159 141 73 216 0 201 159 0 182 175 175 210 186 159 198 210 198 159 159 182 184 159 186 159 129 228 220 129 215 201 0 0 </values> </instantiation>