| Name | Eternity/ Eternity-07-07_c18.xml |
| MD5SUM | d2370bf20b8fe6e2b2b2b678a676e404 |
| 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 | 0.988587 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 161 |
| Number of constraints | 78 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 49 |
| Distribution of domain sizes | [{"size":10,"count":112},{"size":49,"count":49}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":1,"count":6},{"degree":2,"count":154},{"degree":8,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 49 |
| Distribution of constraint arities | [{"arity":1,"count":28},{"arity":5,"count":49},{"arity":49,"count":1}] |
| Number of extensional constraints | 49 |
| Number of intensional constraints | 28 |
| Distribution of constraint types | [{"type":"extension","count":49},{"type":"intension","count":28},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> id[0][0] id[0][1] id[0][2] id[0][3] id[0][4] id[0][5] id[0][6] id[1][0] id[1][1] id[1][2] id[1][3] id[1][4] id[1][5] id[1][6] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[2][5] id[2][6] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[3][5] id[3][6] id[4][0] id[4][1] id[4][2] id[4][3] id[4][4] id[4][5] id[4][6] id[5][0] id[5][1] id[5][2] id[5][3] id[5][4] id[5][5] id[5][6] id[6][0] id[6][1] id[6][2] id[6][3] id[6][4] id[6][5] id[6][6] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4] top[0][5] top[0][6] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[1][5] top[1][6] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[2][5] top[2][6] top[3][0] top[3][1] top[3][2] top[3][3] top[3][4] top[3][5] top[3][6] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] top[4][5] top[4][6] top[5][0] top[5][1] top[5][2] top[5][3] top[5][4] top[5][5] top[5][6] top[6][0] top[6][1] top[6][2] top[6][3] top[6][4] top[6][5] top[6][6] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[0][5] left[0][6] left[1][0] left[1][1] left[1][2] left[1][3] left[1][4] left[1][5] left[1][6] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[2][5] left[2][6] left[3][0] left[3][1] left[3][2] left[3][3] left[3][4] left[3][5] left[3][6] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] left[4][5] left[4][6] left[5][0] left[5][1] left[5][2] left[5][3] left[5][4] left[5][5] left[5][6] left[6][0] left[6][1] left[6][2] left[6][3] left[6][4] left[6][5] left[6][6] bot[0] bot[1] bot[2] bot[3] bot[4] bot[5] bot[6] right[0] right[1] right[2] right[3] right[4] right[5] right[6] </list> <values> 0 19 21 14 12 8 2 15 43 37 34 48 35 10 5 40 44 31 42 39 7 4 27 30 25 45 28 17 9 24 29 38 46 41 6 22 36 26 32 33 47 23 3 16 18 13 11 20 1 0 0 0 0 0 0 0 2 5 6 8 7 8 2 1 7 9 6 9 9 2 1 5 6 4 6 5 1 1 4 6 5 7 5 3 3 5 7 7 8 8 1 3 9 4 8 5 6 3 0 1 3 3 2 2 1 0 9 9 4 9 6 4 0 6 7 8 9 5 7 0 5 7 4 7 8 4 0 8 4 5 8 6 6 0 8 4 7 4 9 9 0 2 3 2 2 3 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>