| Name | Haystacks/Haystacks-m1-s1/ Haystacks-39.xml |
| MD5SUM | d98706ba09ce10101abc58d3245f3903 |
| 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 | 1521 |
| Number of constraints | 28937 |
| Number of domains | 1 |
| Minimum domain size | 39 |
| Maximum domain size | 39 |
| Distribution of domain sizes | [{"size":39,"count":1521}] |
| Minimum variable degree | 38 |
| Maximum variable degree | 39 |
| Distribution of variable degrees | [{"degree":38,"count":1445},{"degree":39,"count":76}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":28937}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 28937 |
| Distribution of constraint types | [{"type":"intension","count":28937}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: