| Name | QueenAttacking/QueenAttacking-m1-s1/ QueenAttacking-17.xml |
| MD5SUM | dc7df4a3b3f37e7a6c8d4746a81abb92 |
| 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 | 351 |
| Number of constraints | 350 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 289 |
| Distribution of domain sizes | [{"size":2,"count":61},{"size":289,"count":290}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 61 |
| Distribution of variable degrees | [{"degree":2,"count":63},{"degree":3,"count":226},{"degree":4,"count":61},{"degree":61,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 289 |
| Distribution of constraint arities | [{"arity":2,"count":288},{"arity":3,"count":61},{"arity":289,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 349 |
| Distribution of constraint types | [{"type":"intension","count":349},{"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: