| Name | StripPacking/ StripPacking-1b_c18.xml |
| MD5SUM | 1d962658b6cfa8354278e550b215e9b2 |
| 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 | 0.636192 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 31 |
| Number of domains | 12 |
| Minimum domain size | 1 |
| Maximum domain size | 15 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":28},{"size":15,"count":20}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":10},{"degree":2,"count":20},{"degree":3,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":2,"count":20},{"arity":3,"count":10},{"arity":40,"count":1}] |
| Number of extensional constraints | 10 |
| Number of intensional constraints | 20 |
| Distribution of constraint types | [{"type":"extension","count":10},{"type":"intension","count":20},{"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 type="solution"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] w[0] w[1] w[2] w[3] w[4] w[5] w[6] w[7] w[8] w[9] h[0] h[1] h[2] h[3] h[4] h[5] h[6] h[7] h[8] h[9] r[0] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] r[9] </list> <values> 5 5 7 0 0 12 0 13 5 11 9 6 3 3 0 0 8 9 3 7 8 6 5 5 12 3 5 2 2 4 6 3 3 5 3 7 7 6 3 2 0 1 1 0 1 0 0 0 1 0 </values> </instantiation>