| Name | MagicHexagon/ MagicHexagon-05-0006_c18.xml |
| MD5SUM | c9b27afa5f83f52385759d74be3b3eae |
| 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 | 2321.49 |
| 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 |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-31) (complete) | 4307134 | SAT | 2321.49 | 299.513 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296950 | SAT | 4713.26 | 598.293 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307370 | SAT | 8935.99 | 1128.56 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309041 | ? (TO) | 19969.1 | 2520.34 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291272 | ? (TO) | 19972.2 | 2520.29 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297685 | ? (TO) | 20013.2 | 2520.12 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297186 | ? (TO) | 20043.1 | 2520.17 |
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>30 39 64 66 45 59 8 56 25 36 60 46 53 18 31 20 26 50 62 63 10 16 15 13 28 37 47 41 7 9 14 11 29 34 52 40 24 21 23 12 38 32 54 65 27 6 17 33 35 61 49 42 57 22 55 19 43 48 44 51 58</values> </instantiation>