| Name | MagicHexagon/ MagicHexagon-06-m001_c18.xml |
| MD5SUM | 6b753b1e1a3070adcb3424354b76057b |
| 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 | 810.179 |
| 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 |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300137 | SAT | 810.179 | 810.204 |
| NACRE 1.0.4 (complete) | 4300140 | ? (TO) | 2519.61 | 2520.06 |
| miniBTD_12 2018.07.27_12 (complete) | 4300897 | ? (TO) | 2519.94 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300721 | ? (TO) | 2519.96 | 2520.01 |
| slowpoke 2018-04-29 (incomplete) | 4300141 | ? (TO) | 2520.02 | 2504.61 |
| MiniCPFever 2018-04-29 (complete) | 4300139 | ? (TO) | 2520.04 | 2511.51 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300143 | ? (TO) | 2520.04 | 2513.02 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300142 | ? (TO) | 2520.06 | 2514.02 |
| miniBTD 2018.07.27_3 (complete) | 4301073 | ? (TO) | 2520.06 | 2520.01 |
| GG's minicp 2018-04-29 (complete) | 4300138 | ? (TO) | 2520.08 | 2502.41 |
| The dodo solver 2018-04-29 (complete) | 4300144 | ? (TO) | 2520.1 | 2511.81 |
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>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[1][10] 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[2][8] x[2][9] x[2][10] 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[3][9] x[3][10] 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[4][10] 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[6][10] 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[7][9] x[7][10] 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[8][8] x[8][9] x[8][10] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] x[9][10] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7] x[10][8] x[10][9] x[10][10] </list> <values>31 0 83 85 84 81 * * * * * 69 86 52 51 50 18 38 * * * * 35 15 20 55 56 57 58 68 * * * 74 88 54 3 4 11 10 49 71 * * 73 87 14 23 6 29 16 8 36 72 * 82 -1 53 9 26 30 46 5 37 43 34 89 21 7 45 19 12 13 42 40 76 * 67 65 2 22 17 41 48 25 77 * * 66 64 1 28 39 44 47 75 * * * 27 63 60 61 24 59 70 * * * * 33 79 80 62 78 32 * * * * * </values> </instantiation>