| Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-11-0066.xml |
| MD5SUM | 0b8750a079fea2eda3490f2b84dad210 |
| 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 | 441 |
| Number of constraints | 70 |
| Number of domains | 1 |
| Minimum domain size | 331 |
| Maximum domain size | 331 |
| Distribution of domain sizes | [{"size":331,"count":331}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":110},{"degree":4,"count":325},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 331 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":11,"count":6},{"arity":12,"count":6},{"arity":13,"count":6},{"arity":14,"count":6},{"arity":15,"count":6},{"arity":16,"count":6},{"arity":17,"count":6},{"arity":18,"count":6},{"arity":19,"count":6},{"arity":20,"count":6},{"arity":21,"count":3},{"arity":331,"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":63}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260129 | ? (TO) | 2400.04 | 2399.8999 |
| miniBTD 2017-06-30 (complete) | 4253147 | ? (TO) | 2400.05 | 2400 |
| Naxos 1.1.0 (complete) | 4253149 | ? (TO) | 2400.06 | 2402.41 |
| miniBTD 2017-08-10 (complete) | 4264869 | ? (TO) | 2400.0601 | 2400.1101 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253148 | ? (TO) | 2400.07 | 2400 |
| cosoco-mini 1.12 (complete) | 4267310 | ? (TO) | 2400.0901 | 2400.1101 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: