| Name | StripPacking/StripPacking-m1-series1/ StripPacking-C3P2.xml |
| MD5SUM | ec554133dcdc77f0ded322158f487a65 |
| 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 | 226.379 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 145 |
| Number of constraints | 88 |
| Number of domains | 30 |
| Minimum domain size | 1 |
| Maximum domain size | 60 |
| Distribution of domain sizes | [{"size":1,"count":4},{"size":2,"count":83},{"size":30,"count":29},{"size":60,"count":29}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":29},{"degree":2,"count":58},{"degree":3,"count":58}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 116 |
| Distribution of constraint arities | [{"arity":2,"count":58},{"arity":3,"count":29},{"arity":116,"count":1}] |
| Number of extensional constraints | 29 |
| Number of intensional constraints | 58 |
| Distribution of constraint types | [{"type":"extension","count":29},{"type":"intension","count":58},{"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] x[24] x[25] x[26] x[27] x[28] 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] y[24] y[25] y[26] y[27] y[28] w[0] w[1] w[2] w[3] w[4] w[5] w[6] w[7] w[8] w[9] w[10] w[11] w[12] w[13] w[14] w[15] w[16] w[17] w[18] w[19] w[20] w[21] w[22] w[23] w[24] w[25] w[26] w[27] w[28] h[0] h[1] h[2] h[3] h[4] h[5] h[6] h[7] h[8] h[9] h[10] h[11] h[12] h[13] h[14] h[15] h[16] h[17] h[18] h[19] h[20] h[21] h[22] h[23] h[24] h[25] h[26] h[27] h[28] r[0] r[1] r[2] r[3] r[4] r[5] r[6] r[7] r[8] r[9] r[10] r[11] r[12] r[13] r[14] r[15] r[16] r[17] r[18] r[19] r[20] r[21] r[22] r[23] r[24] r[25] r[26] r[27] r[28]</list> <values>15 58 48 42 20 48 0 10 46 31 0 55 31 55 21 25 10 4 10 46 33 21 7 33 20 37 55 23 4 17 0 0 0 11 23 0 17 0 0 11 19 13 12 11 6 23 0 11 7 13 13 0 14 15 6 7 23 6 18 2 10 4 1 7 4 5 2 11 10 5 2 5 4 12 13 3 10 9 4 10 24 9 1 5 3 25 21 6 12 7 23 4 7 11 6 7 6 19 11 4 7 2 7 7 6 6 16 1 4 6 9 2 8 5 7 5 0 1 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 1 0 0 0 0 0 0 1 0 0</values> </instantiation>