| Name | StripPacking/ StripPacking-N1c_c18.xml |
| MD5SUM | 19f4dcf35e46defaa68e633424c84ce1 |
| 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 | 72.0175 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 85 |
| Number of constraints | 52 |
| Number of domains | 19 |
| Minimum domain size | 2 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":2,"count":51},{"size":200,"count":34}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":17},{"degree":2,"count":34},{"degree":3,"count":34}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 68 |
| Distribution of constraint arities | [{"arity":2,"count":34},{"arity":3,"count":17},{"arity":68,"count":1}] |
| Number of extensional constraints | 17 |
| Number of intensional constraints | 34 |
| Distribution of constraint types | [{"type":"extension","count":17},{"type":"intension","count":34},{"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> w[] h[] r[] y[] x[] </list> <values> 86 54 81 88 117 32 42 15 55 10 78 29 40 49 64 30 34 35 17 36 70 42 5 12 25 11 40 26 44 77 86 79 9 121 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 112 147 164 0 70 147 152 164 189 112 0 26 112 26 121 112 0 40 40 55 78 49 94 94 40 0 126 0 49 0 0 136 136 166 </values> </instantiation>