| Name | csp/queenAttacking/ normalized-queenAttacking-5.xml |
| MD5SUM | 3df5407575bf7272c239ef529a9d0e05 |
| Bench Category | 2-ARY-INT (binary constraints in intension) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 0.048992 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 26 |
| Number of constraints | 309 |
| Maximum constraint arity | 2 |
| Maximum domain size | 25 |
| Number of constraints which are defined in extension | 0 |
| Number of constraints which are defined in intension | 309 |
| Global constraints used (with number of constraints) |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
Solution found:12 20 17 24 13 4 7 0 11 2 5 16 23 14 3 6 15 22 19 8 1 12 9 18 21 10