| Name | StripPacking/ StripPacking-T1a_c18.xml |
| MD5SUM | 2930e4ba32e3c7874205f5eb3c8396db |
| 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 | 223.932 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop both+glucose-syrup (2018-07-31) (complete) | 4307441 | SAT | 223.932 | 30.8142 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297257 | SAT | 333.315 | 43.8079 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307205 | SAT | 1088.5 | 139.387 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297021 | SAT | 2303.5 | 290.847 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297756 | ? (TO) | 19949.1 | 2520.14 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309112 | ? (TO) | 20070.5 | 2520.28 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291343 | ? (TO) | 20081.7 | 2520.83 |
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>0 0 0 13 13 22 22 38 77 77 114 143 154 143 114 114 180 118 81 0 102 81 52 0 102 98 52 171 98 108 108 158 98 52 38 13 22 25 64 55 178 39 37 103 86 37 26 11 40 29 20 82 37 81 16 21 29 52 98 102 46 29 10 63 50 13 60 119 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1</values> </instantiation>