| Name | csp/queenAttacking/ normalized-queenAttacking-3.xml |
| MD5SUM | 7c7d2bd47e49bff016e6945f19c1acba |
| Bench Category | 2-ARY-INT (binary constraints in intension) |
| Best result obtained on this benchmark | UNSAT |
| Best CPU time to get the best result obtained on this benchmark | 0.008997 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10 |
| Number of constraints | 40 |
| Maximum constraint arity | 2 |
| Maximum domain size | 9 |
| Number of constraints which are defined in extension | 0 |
| Number of constraints which are defined in intension | 40 |
| 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: