| Name | Eternity/ Eternity-10-06_c18.xml |
| MD5SUM | 059f43a1252946c8053c49ce4c65015d |
| 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 | 1010.43 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 196 |
| Number of constraints | 93 |
| Number of domains | 2 |
| Minimum domain size | 11 |
| Maximum domain size | 60 |
| Distribution of domain sizes | [{"size":11,"count":136},{"size":60,"count":60}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":1,"count":9},{"degree":2,"count":186},{"degree":11,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 60 |
| Distribution of constraint arities | [{"arity":1,"count":32},{"arity":5,"count":60},{"arity":60,"count":1}] |
| Number of extensional constraints | 60 |
| Number of intensional constraints | 32 |
| Distribution of constraint types | [{"type":"extension","count":60},{"type":"intension","count":32},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| MiniCPFever 2018-04-29 (complete) | 4300501 | SAT | 1010.43 | 993.852 |
| minimacht 2018.07.27 (complete) | 4300734 | ? | 2520.02 | 2519.74 |
| miniBTD 2018.07.27_3 (complete) | 4301086 | ? | 2520.03 | 2519.96 |
| NACRE 1.0.4 (complete) | 4300502 | ? (TO) | 2519.66 | 2520.02 |
| cosoco 1.12 (complete) | 4300499 | ? (TO) | 2519.69 | 2520.01 |
| miniBTD_12 2018.07.27_12 (complete) | 4300910 | ? (TO) | 2519.74 | 2520.01 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300505 | ? (TO) | 2520.08 | 2510.81 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300504 | ? (TO) | 2520.09 | 2478.03 |
| slowpoke 2018-04-29 (incomplete) | 4300503 | ? (TO) | 2520.09 | 2506.81 |
| GG's minicp 2018-04-29 (complete) | 4300500 | ? (TO) | 2520.1 | 2506.13 |
| The dodo solver 2018-04-29 (complete) | 4300506 | ? (TO) | 2520.11 | 2507.61 |
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[0][4] id[0][5] id[1][0] id[1][1] id[1][2] id[1][3] id[1][4] id[1][5] id[2][0] id[2][1] id[2][2] id[2][3] id[2][4] id[2][5] id[3][0] id[3][1] id[3][2] id[3][3] id[3][4] id[3][5] id[4][0] id[4][1] id[4][2] id[4][3] id[4][4] id[4][5] id[5][0] id[5][1] id[5][2] id[5][3] id[5][4] id[5][5] id[6][0] id[6][1] id[6][2] id[6][3] id[6][4] id[6][5] id[7][0] id[7][1] id[7][2] id[7][3] id[7][4] id[7][5] id[8][0] id[8][1] id[8][2] id[8][3] id[8][4] id[8][5] id[9][0] id[9][1] id[9][2] id[9][3] id[9][4] id[9][5] top[0][0] top[0][1] top[0][2] top[0][3] top[0][4] top[0][5] top[1][0] top[1][1] top[1][2] top[1][3] top[1][4] top[1][5] top[2][0] top[2][1] top[2][2] top[2][3] top[2][4] top[2][5] top[3][0] top[3][1] top[3][2] top[3][3] top[3][4] top[3][5] top[4][0] top[4][1] top[4][2] top[4][3] top[4][4] top[4][5] top[5][0] top[5][1] top[5][2] top[5][3] top[5][4] top[5][5] top[6][0] top[6][1] top[6][2] top[6][3] top[6][4] top[6][5] top[7][0] top[7][1] top[7][2] top[7][3] top[7][4] top[7][5] top[8][0] top[8][1] top[8][2] top[8][3] top[8][4] top[8][5] top[9][0] top[9][1] top[9][2] top[9][3] top[9][4] top[9][5] left[0][0] left[0][1] left[0][2] left[0][3] left[0][4] left[0][5] left[1][0] left[1][1] left[1][2] left[1][3] left[1][4] left[1][5] left[2][0] left[2][1] left[2][2] left[2][3] left[2][4] left[2][5] left[3][0] left[3][1] left[3][2] left[3][3] left[3][4] left[3][5] left[4][0] left[4][1] left[4][2] left[4][3] left[4][4] left[4][5] left[5][0] left[5][1] left[5][2] left[5][3] left[5][4] left[5][5] left[6][0] left[6][1] left[6][2] left[6][3] left[6][4] left[6][5] left[7][0] left[7][1] left[7][2] left[7][3] left[7][4] left[7][5] left[8][0] left[8][1] left[8][2] left[8][3] left[8][4] left[8][5] left[9][0] left[9][1] left[9][2] left[9][3] left[9][4] left[9][5] bot[0] bot[1] bot[2] bot[3] bot[4] bot[5] right[0] right[1] right[2] right[3] right[4] right[5] right[6] right[7] right[8] right[9] </list> <values> 0 25 13 7 21 1 9 56 41 31 28 5 8 55 58 49 40 10 24 33 34 47 37 12 22 42 39 45 57 6 17 48 30 44 59 26 23 51 32 53 52 16 18 38 29 46 54 19 4 36 35 50 43 14 2 11 20 27 15 3 0 0 0 0 0 0 1 8 4 7 4 1 1 6 9 5 4 1 3 9 7 9 5 1 3 6 10 5 8 2 2 5 4 5 9 1 3 9 5 7 8 3 2 6 4 7 6 2 1 8 7 5 6 2 3 10 10 10 5 2 0 1 3 2 1 3 0 9 8 10 4 6 0 8 8 8 9 10 0 7 4 7 7 4 0 5 8 7 9 6 0 8 7 5 10 9 0 6 6 6 9 6 0 10 4 7 8 10 0 4 4 10 9 5 0 1 2 3 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>