| Name | MagicHexagon/ MagicHexagon-04-m004_c18.xml |
| MD5SUM | 2f4e790a4fde13aad103094a46699cf0 |
| 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.702516 |
| 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 |
|---|---|---|---|---|
| GG's minicp 2018-04-29 (complete) | 4300154 | SAT | 0.702516 | 0.375451 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300159 | SAT | 1.89492 | 1.00038 |
| slowpoke 2018-04-29 (incomplete) | 4300157 | SAT | 2.49903 | 1.05454 |
| MiniCPFever 2018-04-29 (complete) | 4300155 | SAT | 2.61513 | 1.46187 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300158 | SAT | 3.1049 | 1.86339 |
| NACRE 1.0.4 (complete) | 4300156 | SAT | 7.69379 | 7.69467 |
| cosoco 1.12 (complete) | 4300153 | SAT | 13.0618 | 13.0644 |
| miniBTD_12 2018.07.27_12 (complete) | 4300893 | SAT | 183.111 | 183.113 |
| minimacht 2018.07.27 (complete) | 4300717 | SAT | 183.727 | 183.733 |
| miniBTD 2018.07.27_3 (complete) | 4301069 | SAT | 274.47 | 274.512 |
| The dodo solver 2018-04-29 (complete) | 4300160 | SAT (TO) | 2520.02 | 2509.41 |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] 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[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[6][0] x[6][1] x[6][2] x[6][3] </list> <values> -4 31 32 15 29 18 -1 1 27 30 -3 5 0 14 28 19 21 11 6 10 3 4 7 2 17 16 8 24 25 12 -2 13 26 23 9 22 20 </values> </instantiation>