Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-13.xml |
MD5SUM | 83249ccae4b5534eb2335929a7f4c3a6 |
Bench Category | COP (optimization 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 | 209 |
Number of constraints | 208 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 169 |
Distribution of domain sizes | [{"size":2,"count":39},{"size":169,"count":170}] |
Minimum variable degree | 2 |
Maximum variable degree | 39 |
Distribution of variable degrees | [{"degree":2,"count":41},{"degree":3,"count":128},{"degree":4,"count":39},{"degree":39,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 169 |
Distribution of constraint arities | [{"arity":2,"count":168},{"arity":3,"count":39},{"arity":169,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 207 |
Distribution of constraint types | [{"type":"intension","count":207},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: