| Name | ColouredQueens/ ColouredQueens-08_c18.xml |
| MD5SUM | 097ee2ac2bfb45f3aedded97da1eabe0 |
| 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 | 0.180408 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 42 |
| Number of domains | 1 |
| Minimum domain size | 8 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":8,"count":64}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":60}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":4},{"arity":8,"count":18}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":42}] |
| 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: