| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-03.xml |
| MD5SUM | 900c14a4349c1ff206d580a6a8eed87f |
| 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.018456001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 14 |
| Number of constraints | 13 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":2,"count":4},{"size":9,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":6},{"degree":3,"count":3},{"degree":4,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":8},{"arity":3,"count":4},{"arity":9,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 12 |
| Distribution of constraint types | [{"type":"intension","count":12},{"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: