| Name | MagicHexagon/ MagicHexagon-04-0017_c18.xml |
| MD5SUM | 5026d1a6c388113c28cc4e99e58b99c3 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 9.00397 |
| 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 |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291270 | UNSAT | 9.00397 | 3.31689 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309039 | UNSAT | 9.06616 | 3.00873 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297683 | UNSAT | 13.1168 | 2.17327 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297184 | UNSAT | 20.1462 | 4.37405 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296948 | UNSAT | 21.0939 | 4.49374 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307368 | UNSAT | 21.4031 | 5.38939 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307132 | UNSAT | 24.719 | 5.63261 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: