Name | csp/graphColoring/leighton/leighton-15/ normalized-lei450-15b-15.xml |
MD5SUM | 35302e8d76135ec307bb87b29bd78b43 |
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.402938 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 450 |
Number of constraints | 8169 |
Maximum constraint arity | 2 |
Maximum domain size | 15 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 8169 |
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:13 13 1 6 1 14 3 13 3 1 2 13 11 9 2 12 10 5 9 14 9 8 0 10 7 10 0 1 0 5 5 0 4 9 8 8 8 12 2 3 11 6 1 9 5 6 11 0 3 1 4 1 1 8 12 8 1 4 1 3 13 14 8 14 2 1 2 10 14 14 12 0 9 7 12 11 2 13 8 12 3 4 1 4 1 4 7 11 7 4 0 0 12 2 11 9 11 3 14 9 0 7 0 14 14 5 12 0 6 0 2 10 8 7 5 5 0 7 9 9 13 8 7 14 10 8 8 6 0 2 9 4 13 2 10 13 6 5 10 14 3 7 2 5 5 9 8 2 6 1 4 14 10 9 11 13 6 4 1 7 10 8 4 7 8 10 0 14 4 5 8 14 11 10 12 5 6 11 10 3 7 14 2 13 12 0 10 2 7 12 13 1 5 7 14 11 10 13 0 2 0 1 9 3 13 0 13 11 2 12 5 4 1 6 2 13 4 11 10 14 9 1 11 0 4 4 1 11 6 1 3 3 11 12 5 0 13 6 1 10 11 11 0 9 10 0 13 7 10 2 6 1 12 13 13 8 14 0 10 12 7 1 11 0 7 6 8 2 7 3 1 10 1 5 3 1 4 11 14 5 4 12 6 12 8 11 8 0 6 5 6 0 12 9 14 11 5 12 0 11 7 10 13 10 13 1 12 10 0 13 13 13 3 14 10 0 5 6 2 12 1 7 1 14 14 8 1 2 11 14 12 12 5 6 6 13 8 8 9 12 9 6 8 3 4 5 0 2 0 2 0 8 0 13 11 7 4 7 4 3 3 5 3 7 4 1 4 3 3 7 10 13 6 7 14 4 11 9 3 10 1 1 0 0 8 2 8 14 7 0 1 8 6 6 14 2 0 0 2 5 2 1 4 14 3 7 0 5 0 14 14 12 2 4 0 12 4 12 9 3 12 5 5 9 14 5 3 9 6 2 12 14 6 1 14 0 6 11 4 2 3 6 10 3 14 13 1 13 1 10