| Name | MagicHexagon/ MagicHexagon-06-0010_c18.xml |
| MD5SUM | a4a3304b5e9aae9c2bcc59fc5ef6ae6f |
| 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 | 294.829 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 121 |
| Number of constraints | 40 |
| Number of domains | 1 |
| Minimum domain size | 91 |
| Maximum domain size | 91 |
| Distribution of domain sizes | [{"size":91,"count":91}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":30},{"degree":4,"count":85},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 91 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":6,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":6},{"arity":10,"count":6},{"arity":11,"count":3},{"arity":91,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6 |
| Distribution of constraint types | [{"type":"intension","count":6},{"type":"allDifferent","count":1},{"type":"sum","count":33}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| GG's minicp 2018-04-29 (complete) | 4300130 | SAT | 294.829 | 291.151 |
| NACRE 1.0.4 (complete) | 4300132 | ? (TO) | 2519.63 | 2520.01 |
| miniBTD_12 2018.07.27_12 (complete) | 4300896 | ? (TO) | 2519.88 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300720 | ? (TO) | 2519.94 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300134 | ? (TO) | 2520.03 | 2513.51 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300135 | ? (TO) | 2520.05 | 2511.21 |
| cosoco 1.12 (complete) | 4300129 | ? (TO) | 2520.07 | 2520.01 |
| slowpoke 2018-04-29 (incomplete) | 4300133 | ? (TO) | 2520.08 | 2505.71 |
| MiniCPFever 2018-04-29 (complete) | 4300131 | ? (TO) | 2520.1 | 2511.41 |
| miniBTD 2018.07.27_3 (complete) | 4301072 | ? (TO) | 2520.1 | 2519.9 |
| The dodo solver 2018-04-29 (complete) | 4300136 | ? (TO) | 2520.11 | 2507.21 |
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> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[5][10] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] </list> <values> 10 52 98 99 100 96 66 30 69 70 71 73 76 93 67 55 35 27 50 51 77 94 72 25 42 23 26 37 57 79 95 74 54 14 17 20 21 22 58 80 97 75 56 15 19 13 31 28 36 38 47 85 12 40 16 32 49 41 43 59 78 86 53 29 18 44 45 39 60 81 87 64 48 34 33 46 61 82 89 68 24 62 63 65 84 11 88 90 91 92 83 </values> </instantiation>