| Name | StripPacking/ StripPacking-C2P1_c18.xml |
| MD5SUM | bb34988e6b0e49ae8f3222e70708ff44 |
| 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 | 12.2518 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 125 |
| Number of constraints | 76 |
| Number of domains | 25 |
| Minimum domain size | 1 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":73},{"size":15,"count":25},{"size":40,"count":25}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":25},{"degree":2,"count":50},{"degree":3,"count":50}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":2,"count":50},{"arity":3,"count":25},{"arity":100,"count":1}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 50 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"intension","count":50},{"type":"noOverlap","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop both+glucose-syrup (2018-07-31) (complete) | 4307437 | SAT | 12.2518 | 4.04513 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297017 | SAT | 15.6905 | 3.59673 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307201 | SAT | 25.2093 | 5.52911 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297253 | SAT | 26.2374 | 4.89199 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297752 | SAT | 98.7409 | 13.0338 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309108 | ? (TO) | 20046.6 | 2520.41 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291339 | ? (TO) | 20050.5 | 2520.42 |
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] 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] 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] 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] 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]</list> <values>18 0 18 18 29 33 2 0 2 0 30 27 25 27 30 33 18 38 25 25 13 18 24 13 0 10 6 13 8 10 0 0 13 2 9 2 13 7 7 0 3 4 3 9 4 2 0 4 0 0 11 13 9 7 9 7 11 13 11 13 3 11 2 11 3 5 6 2 2 5 5 12 1 5 2 3 3 2 2 3 3 2 2 4 4 5 2 2 3 2 4 4 12 1 3 13 4 4 2 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 0 0 0 1</values> </instantiation>