Name | csp/queenAttacking/ normalized-queenAttacking-7.xml |
MD5SUM | 10d8cce48e24d9d5d1e136c73b47f566 |
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 | 450.699 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 50 |
Number of constraints | 1191 |
Maximum constraint arity | 2 |
Maximum domain size | 49 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 1191 |
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:16 0 15 28 43 30 35 44 31 22 9 4 17 2 7 16 1 10 5 20 25 38 23 14 29 42 37 46 33 48 39 24 11 6 19 34 47 32 41 26 13 18 3 8 21 36 45 40 27 12