| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-04.xml |
| MD5SUM | 2ada0409f2c6e70f95908de4e7f6edb2 |
| Bench Category | COP (optimization 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.28914499 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 23 |
| Number of constraints | 22 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":2,"count":6},{"size":16,"count":17}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":2,"count":8},{"degree":3,"count":8},{"degree":4,"count":6},{"degree":6,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":2,"count":15},{"arity":3,"count":6},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 21 |
| Distribution of constraint types | [{"type":"intension","count":21},{"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: