| Name | Eternity/ Eternity-10-05_c18.xml |
| MD5SUM | 6e3279f6b90dee0013fa01f52c3f5b67 |
| 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 | 1.08373 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 165 |
| Number of constraints | 81 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":10,"count":115},{"size":50,"count":50}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":1,"count":9},{"degree":2,"count":155},{"degree":11,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":1,"count":30},{"arity":5,"count":50},{"arity":50,"count":1}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 30 |
| Distribution of constraint types | [{"type":"extension","count":50},{"type":"intension","count":30},{"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[1][0] id[1][1] id[1][2] id[1][3] id[1][4] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[4][0] id[4][1] id[4][2] id[4][3] id[4][4] id[5][0] id[5][1] id[5][2] id[5][3] id[5][4] id[6][0] id[6][1] id[6][2] id[6][3] id[6][4] id[7][0] id[7][1] id[7][2] id[7][3] id[7][4] id[8][0] id[8][1] id[8][2] id[8][3] id[8][4] id[9][0] id[9][1] id[9][2] id[9][3] id[9][4] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[3][0] top[3][1] top[3][2] top[3][3] top[3][4] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] top[5][0] top[5][1] top[5][2] top[5][3] top[5][4] top[6][0] top[6][1] top[6][2] top[6][3] top[6][4] top[7][0] top[7][1] top[7][2] top[7][3] top[7][4] top[8][0] top[8][1] top[8][2] top[8][3] top[8][4] top[9][0] top[9][1] top[9][2] top[9][3] top[9][4] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[1][0] left[1][1] left[1][2] left[1][3] left[1][4] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[3][0] left[3][1] left[3][2] left[3][3] left[3][4] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] left[5][0] left[5][1] left[5][2] left[5][3] left[5][4] left[6][0] left[6][1] left[6][2] left[6][3] left[6][4] left[7][0] left[7][1] left[7][2] left[7][3] left[7][4] left[8][0] left[8][1] left[8][2] left[8][3] left[8][4] left[9][0] left[9][1] left[9][2] left[9][3] left[9][4] bot[0] bot[1] bot[2] bot[3] bot[4] right[0] right[1] right[2] right[3] right[4] right[5] right[6] right[7] right[8] right[9] </list> <values> 2 5 22 11 1 24 45 33 40 10 4 30 31 35 19 7 32 38 39 18 8 36 34 27 12 9 44 28 26 16 6 43 41 29 21 23 47 46 37 13 14 42 49 48 17 3 20 25 15 0 0 0 0 0 0 3 5 7 9 2 1 9 7 6 1 1 7 6 8 3 1 4 4 4 2 1 6 5 5 2 1 7 5 4 2 3 8 6 6 3 2 7 8 8 2 3 5 8 6 2 0 2 1 3 1 0 8 9 4 9 0 5 4 6 4 0 7 9 9 9 0 8 8 8 4 0 9 5 4 7 0 5 5 6 6 0 7 6 7 4 0 5 8 7 9 0 3 3 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>