| Name | Eternity/ Eternity-10-04_c18.xml |
| MD5SUM | f6e7bfb75851ce9d6d95540719dd30c6 |
| 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 | 11.9033 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 134 |
| Number of constraints | 69 |
| Number of domains | 2 |
| Minimum domain size | 9 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":9,"count":94},{"size":40,"count":40}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":1,"count":9},{"degree":2,"count":124},{"degree":11,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":1,"count":28},{"arity":5,"count":40},{"arity":40,"count":1}] |
| Number of extensional constraints | 40 |
| Number of intensional constraints | 28 |
| Distribution of constraint types | [{"type":"extension","count":40},{"type":"intension","count":28},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309055 | SAT | 11.9033 | 3.16 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291286 | SAT | 12.0922 | 3.27267 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297699 | SAT | 16.3538 | 2.61501 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297200 | SAT | 21.8201 | 8.37438 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307384 | SAT | 24.6701 | 9.2866 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307148 | SAT | 25.9266 | 9.42896 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296964 | SAT | 27.8857 | 9.21743 |
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] id[4][0] id[4][1] id[4][2] id[4][3] id[5][0] id[5][1] id[5][2] id[5][3] id[6][0] id[6][1] id[6][2] id[6][3] id[7][0] id[7][1] id[7][2] id[7][3] id[8][0] id[8][1] id[8][2] id[8][3] id[9][0] id[9][1] id[9][2] id[9][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] top[4][0] top[4][1] top[4][2] top[4][3] top[5][0] top[5][1] top[5][2] top[5][3] top[6][0] top[6][1] top[6][2] top[6][3] top[7][0] top[7][1] top[7][2] top[7][3] top[8][0] top[8][1] top[8][2] top[8][3] top[9][0] top[9][1] top[9][2] top[9][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] left[4][0] left[4][1] left[4][2] left[4][3] left[5][0] left[5][1] left[5][2] left[5][3] left[6][0] left[6][1] left[6][2] left[6][3] left[7][0] left[7][1] left[7][2] left[7][3] left[8][0] left[8][1] left[8][2] left[8][3] left[9][0] left[9][1] left[9][2] left[9][3] bot[0] bot[1] bot[2] bot[3] right[0] right[1] right[2] right[3] right[4] right[5] right[6] right[7] right[8] right[9] </list> <values> 1 12 18 3 19 24 29 16 23 39 35 14 4 25 38 22 17 32 36 7 9 37 30 8 20 33 31 21 13 34 28 10 5 27 26 11 2 15 6 0 0 0 0 0 3 4 4 3 3 7 5 2 1 6 5 2 2 4 6 3 1 8 6 1 3 5 4 1 2 8 8 3 1 5 4 1 3 7 5 1 0 2 2 3 0 4 5 7 0 8 8 6 0 4 7 7 0 8 8 5 0 6 7 6 0 5 6 7 0 5 6 7 0 4 4 8 0 2 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>