| Name | MagicHexagon/ MagicHexagon-04-0003_c18.xml |
| MD5SUM | dd4ed178c47046d12ce38b3d0d17c272 |
| 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 | 0.33727 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 49 |
| Number of constraints | 28 |
| Number of domains | 1 |
| Minimum domain size | 37 |
| Maximum domain size | 37 |
| Distribution of domain sizes | [{"size":37,"count":37}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":12},{"degree":4,"count":31},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 37 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":4,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":3},{"arity":37,"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":21}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300185 | SAT | 0.33727 | 0.338769 |
| NACRE 1.0.4 (complete) | 4300188 | SAT | 0.552906 | 0.558492 |
| GG's minicp 2018-04-29 (complete) | 4300186 | SAT | 1.27429 | 0.559303 |
| slowpoke 2018-04-29 (incomplete) | 4300189 | SAT | 3.54064 | 2.17945 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300191 | SAT | 16.5729 | 15.4791 |
| MiniCPFever 2018-04-29 (complete) | 4300187 | SAT | 16.7775 | 15.5621 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300190 | SAT | 23.018 | 22.0113 |
| miniBTD_12 2018.07.27_12 (complete) | 4300891 | SAT | 37.8631 | 37.8643 |
| minimacht 2018.07.27 (complete) | 4300715 | SAT | 38.2336 | 38.2351 |
| miniBTD 2018.07.27_3 (complete) | 4301067 | SAT | 42.9984 | 43.0091 |
| The dodo solver 2018-04-29 (complete) | 4300192 | ? (TO) | 2520.12 | 2507.02 |
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[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[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values>17 37 39 18 * * * 38 28 4 6 35 * * 36 13 5 8 25 24 * 20 7 15 11 10 14 34 26 16 12 9 21 27 * 32 23 3 22 31 * * 33 29 30 19 * * * </values> </instantiation>