Name | csp/pseudo/garden/ normalized-g-9x3.xml |
MD5SUM | 4ca8aae4b8d7bfaa3d821d8d6ba5a3fb |
Bench Category | N-ARY-INT (n-ary constraints in intension) |
Best result obtained on this benchmark | SAT |
Best CPU time to get the best result obtained on this benchmark | 0.005998 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 27 |
Number of constraints | 27 |
Maximum constraint arity | 5 |
Maximum domain size | 2 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 27 |
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:1 0 0 1 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 0 1 0