Name | csp/graphColoring/leighton/leighton-5/ normalized-lei450-05b-05.xml |
MD5SUM | 0bbb4d756c93a63b24f959ee33533eec |
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 | 0.291954 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 450 |
Number of constraints | 5734 |
Maximum constraint arity | 2 |
Maximum domain size | 5 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 5734 |
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:4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0 4 2 3 1 0