Name | csp/graphColoring/sgb/book/ normalized-david-8.xml |
MD5SUM | a8276ba58018784523de2953f21418d8 |
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.018996 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 87 |
Number of constraints | 406 |
Maximum constraint arity | 2 |
Maximum domain size | 8 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 406 |
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: