Name | csp/queenAttacking/ normalized-queenAttacking-6.xml |
MD5SUM | 329ec630f18fe773f393b0bd33b7aab7 |
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 | 4.23036 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 37 |
Number of constraints | 641 |
Maximum constraint arity | 2 |
Maximum domain size | 36 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 641 |
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:14 24 32 28 17 9 5 16 29 33 22 35 27 19 6 2 13 0 8 4 15 11 3 7 20 31 18 14 1 12 25 21 10 23 34 26 30