| Name | StripPacking/ StripPacking-N1a_c18.xml |
| MD5SUM | 4209eb75c1d6f17ff2fcaefe706080c2 |
| 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 | 118.386 |
| 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> h[] r[] y[] x[] w[] </list> <values> 132 41 32 9 38 29 62 8 26 39 81 18 63 50 91 68 41 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 68 159 168 159 130 130 68 122 104 91 41 104 41 41 0 0 0 167 0 64 64 123 0 110 78 53 0 95 78 53 44 0 110 44 33 64 103 59 44 123 57 32 25 53 15 17 42 9 44 90 66 </values> </instantiation>