| Name | Eternity/ Eternity-04-04_c18.xml |
| MD5SUM | 888903612ba8c9f4d3271c512caeb5d6 |
| 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 | 2.16196 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 56 |
| Number of constraints | 33 |
| Number of domains | 2 |
| Minimum domain size | 6 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":6,"count":40},{"size":16,"count":16}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":1,"count":3},{"degree":2,"count":52},{"degree":5,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":1,"count":16},{"arity":5,"count":16},{"arity":16,"count":1}] |
| Number of extensional constraints | 16 |
| Number of intensional constraints | 16 |
| Distribution of constraint types | [{"type":"extension","count":16},{"type":"intension","count":16},{"type":"allDifferent","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) | 4297693 | SAT | 2.16196 | 0.739829 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309049 | SAT | 4.25211 | 1.91217 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291280 | SAT | 4.57286 | 1.99807 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296958 | SAT | 9.62332 | 3.02798 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297194 | SAT | 9.76503 | 3.05439 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307378 | SAT | 10.9117 | 3.9277 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307142 | SAT | 11.1094 | 3.88887 |
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>id[0][0] id[0][1] id[0][2] id[0][3] id[1][0] id[1][1] id[1][2] id[1][3] id[2][0] id[2][1] id[2][2] id[2][3] id[3][0] id[3][1] id[3][2] id[3][3] top[0][0] top[0][1] top[0][2] top[0][3] top[1][0] top[1][1] top[1][2] top[1][3] top[2][0] top[2][1] top[2][2] top[2][3] top[3][0] top[3][1] top[3][2] top[3][3] left[0][0] left[0][1] left[0][2] left[0][3] left[1][0] left[1][1] left[1][2] left[1][3] left[2][0] left[2][1] left[2][2] left[2][3] left[3][0] left[3][1] left[3][2] left[3][3] bot[0] bot[1] bot[2] bot[3] right[0] right[1] right[2] right[3] </list> <values>0 6 10 1 7 15 13 4 11 12 14 8 2 5 9 3 0 0 0 0 1 4 5 1 2 5 4 1 2 3 4 2 0 1 1 2 0 5 3 3 0 5 3 4 0 1 2 2 0 0 0 0 0 0 0 0 </values> </instantiation>