| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-023.xml |
| MD5SUM | f753def11f9f341c6e9dbf54b2480dee |
| 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 | 88.5458 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 51 |
| Number of domains | 1 |
| Minimum domain size | 186 |
| Maximum domain size | 186 |
| Distribution of domain sizes | [{"size":186,"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> 160 65 43 59 132 59 68 65 43 47 140 43 162 160 132 66 47 96 0 140 0 80 96 0 116 135 135 119 118 126 126 138 119 135 118 96 116 90 90 96 153 90 96 140 139 126 0 0 </values> </instantiation>