| Name | RectPacking/RectPacking-m1-perf/ RectPacking-perfect-012.xml |
| MD5SUM | 2f6e926eec9d3271c32e6368d6cce3f2 |
| 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 | 18.0419 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 46 |
| Number of constraints | 49 |
| Number of domains | 1 |
| Minimum domain size | 140 |
| Maximum domain size | 140 |
| Distribution of domain sizes | [{"size":140,"count":46}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":44},{"degree":3,"count":1},{"degree":4,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 46 |
| Distribution of constraint arities | [{"arity":1,"count":47},{"arity":2,"count":1},{"arity":46,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 48 |
| Distribution of constraint types | [{"type":"intension","count":48},{"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] 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]</list> <values>65 65 62 75 62 54 38 54 79 79 67 75 48 38 66 48 54 0 98 95 0 87 0 53 51 51 113 46 46 82 33 82 98 33 117 113 54 53 82 0 54 98 53 92 0 0</values> </instantiation>