| Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-08-0081.xml |
| MD5SUM | e46647acbda97830867cbaf6bce42852 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 225 |
| Number of constraints | 52 |
| Number of domains | 1 |
| Minimum domain size | 169 |
| Maximum domain size | 169 |
| Distribution of domain sizes | [{"size":169,"count":169}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":56},{"degree":4,"count":163},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 169 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":8,"count":6},{"arity":9,"count":6},{"arity":10,"count":6},{"arity":11,"count":6},{"arity":12,"count":6},{"arity":13,"count":6},{"arity":14,"count":6},{"arity":15,"count":3},{"arity":169,"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":45}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267308 | ? (TO) | 2400.03 | 2400.01 |
| miniBTD 2017-08-10 (complete) | 4264867 | ? (TO) | 2400.0601 | 2400.1101 |
| Naxos 1.1.0 (complete) | 4253137 | ? (TO) | 2400.08 | 2400 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253136 | ? (TO) | 2400.08 | 2400.1 |
| miniBTD 2017-06-30 (complete) | 4253135 | ? (TO) | 2400.09 | 2400 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260127 | ? (TO) | 2400.1001 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: