| Name | StripPacking/ StripPacking-1a_c18.xml |
| MD5SUM | 33ae3e79eb3d2d497b25d2e53ccdbc20 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 2.74483 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 37 |
| Number of domains | 14 |
| Minimum domain size | 1 |
| Maximum domain size | 15 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":34},{"size":15,"count":24}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":1,"count":12},{"degree":2,"count":24},{"degree":3,"count":24}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 48 |
| Distribution of constraint arities | [{"arity":2,"count":24},{"arity":3,"count":12},{"arity":48,"count":1}] |
| Number of extensional constraints | 12 |
| Number of intensional constraints | 24 |
| Distribution of constraint types | [{"type":"extension","count":12},{"type":"intension","count":24},{"type":"noOverlap","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297747 | UNSAT | 2.74483 | 0.900226 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309103 | UNSAT | 3.03838 | 1.47656 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291334 | UNSAT | 3.05031 | 1.51035 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297248 | UNSAT | 3.66386 | 1.74269 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297012 | UNSAT | 3.70785 | 1.74296 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307196 | UNSAT | 4.89048 | 2.59575 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307432 | UNSAT | 4.93037 | 2.58862 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: