| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-029.xml |
| MD5SUM | 46cde9b56a99396b1706cac103cc08fa |
| 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 | 242.093 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 51 |
| Number of domains | 1 |
| Minimum domain size | 203 |
| Maximum domain size | 203 |
| Distribution of domain sizes | [{"size":203,"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>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23]</list> <values>155 136 172 44 94 123 138 105 136 156 54 177 94 172 123 44 136 54 0 155 0 78 105 0 146 145 167 159 105 130 130 98 147 146 145 146 116 172 98 169 167 105 159 98 105 145 0 0</values> </instantiation>