| Name | StripPacking/ StripPacking-C1P2_c18.xml |
| MD5SUM | ea26d3392de34cffb15676b0e6b531a1 |
| 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 | 5.01776 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 85 |
| Number of constraints | 52 |
| Number of domains | 13 |
| Minimum domain size | 1 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":49},{"size":20,"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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-07) (complete) | 4297015 | SAT | 5.01776 | 2.00067 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297251 | SAT | 5.08421 | 2.05953 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307199 | SAT | 6.29578 | 2.91078 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307435 | SAT | 6.33735 | 2.91901 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297750 | SAT | 46.6897 | 6.5392 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309106 | ? (TO) | 20021.7 | 2520.23 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291337 | ? (TO) | 20028.7 | 2520.52 |
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] 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] 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] 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] 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]</list> <values>13 7 0 11 4 13 14 17 0 0 17 5 5 0 15 7 18 8 9 11 9 11 7 9 7 4 9 11 4 7 0 0 14 4 4 4 4 3 3 4 3 1 5 7 3 13 8 15 5 10 2 1 5 9 5 9 1 5 4 5 2 9 3 2 4 4 6 7 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 0 1</values> </instantiation>