| 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 | 3.17265 |
| 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) | 4297684 | SAT | 3.17265 | 0.89353 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297185 | SAT | 43.3363 | 7.71081 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307133 | SAT | 59.1243 | 10.419 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307369 | SAT | 70.7815 | 11.8739 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296949 | SAT | 100.815 | 15.0384 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291271 | ? (TO) | 19969.5 | 2520.32 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309040 | ? (TO) | 19978.6 | 2520.34 |
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 30 29 19 31 12 -1 0 32 27 2 -2 15 6 26 20 7 18 17 1 14 -3 23 8 3 10 5 25 22 11 4 13 24 9 21 16 28 </values> </instantiation>