| Name | MagicHexagon/ MagicHexagon-05-m003_c18.xml |
| MD5SUM | 11e14450858ef922a4bcb0797a1233a1 |
| 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 | 2.44812 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 34 |
| Number of domains | 1 |
| Minimum domain size | 61 |
| Maximum domain size | 61 |
| Distribution of domain sizes | [{"size":61,"count":61}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":20},{"degree":4,"count":55},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 61 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":3},{"arity":61,"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":27}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| GG's minicp 2018-04-29 (complete) | 4300122 | SAT | 2.44812 | 1.02528 |
| slowpoke 2018-04-29 (incomplete) | 4300125 | SAT | 13.8489 | 12.1502 |
| NACRE 1.0.4 (complete) | 4300124 | SAT | 164.971 | 164.986 |
| cosoco 1.12 (complete) | 4300121 | ? (TO) | 2519.84 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300719 | ? (TO) | 2519.91 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300126 | ? (TO) | 2520.02 | 2513.51 |
| miniBTD 2018.07.27_3 (complete) | 4301071 | ? (TO) | 2520.08 | 2520.01 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300127 | ? (TO) | 2520.09 | 2510.21 |
| The dodo solver 2018-04-29 (complete) | 4300128 | ? (TO) | 2520.1 | 2510.51 |
| miniBTD_12 2018.07.27_12 (complete) | 4300895 | ? (TO) | 2520.1 | 2519.9 |
| MiniCPFever 2018-04-29 (complete) | 4300123 | ? (TO) | 2520.11 | 2509.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> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] 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[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[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] </list> <values> -3 19 56 57 54 26 39 11 37 38 32 52 8 29 24 0 28 42 53 40 33 3 6 4 1 43 55 41 9 2 10 18 21 15 12 36 -1 5 30 22 27 20 44 46 7 13 16 25 31 45 48 34 14 17 23 47 -2 49 50 51 35 </values> </instantiation>