Name | ColouredQueens/ ColouredQueens-06_c18.xml |
MD5SUM | 7b867b166641a9e2c5ffb0d7a40768d4 |
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.015727 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 36 |
Number of constraints | 30 |
Number of domains | 1 |
Minimum domain size | 6 |
Maximum domain size | 6 |
Distribution of domain sizes | [{"size":6,"count":36}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":32}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 6 |
Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":14}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":30}] |
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: