| 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 | 1.99571 |
| 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 |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297682 | SAT | 1.99571 | 0.736889 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297183 | SAT | 20.0967 | 4.7543 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296947 | SAT | 30.0396 | 6.17186 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307131 | SAT | 61.9818 | 10.8315 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307367 | SAT | 89.7123 | 14.1521 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291269 | ? (TO) | 19963.4 | 2520.44 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309038 | ? (TO) | 19970.6 | 2520.28 |
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>3 39 32 37 36 21 18 11 25 34 14 9 15 16 23 38 8 4 6 5 24 26 29 17 10 20 7 28 31 19 12 22 27 13 33 35 30 </values> </instantiation>