Name | csp/graphColoring/leighton/leighton-25/ normalized-lei450-25a-25.xml |
MD5SUM | b66a3d28516741bf7d0a0ded75e5fd1c |
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.300954 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 450 |
Number of constraints | 8260 |
Maximum constraint arity | 2 |
Maximum domain size | 25 |
Number of constraints which are defined in extension | 0 |
Number of constraints which are defined in intension | 8260 |
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:11 11 7 5 9 1 21 12 6 21 6 16 1 4 0 8 12 0 13 18 5 16 11 3 2 13 0 2 16 12 10 8 11 3 0 1 18 1 22 21 1 0 14 12 0 6 0 22 2 4 10 12 3 9 2 3 8 14 5 12 23 10 2 6 6 5 11 1 2 21 1 0 11 4 7 14 0 6 23 5 10 3 6 8 9 8 0 13 4 11 9 17 16 2 3 18 7 4 8 20 7 16 5 10 5 21 0 1 11 13 7 1 6 12 4 12 1 4 23 0 13 7 23 1 1 11 15 14 6 3 19 3 9 8 4 11 6 13 0 14 14 21 13 0 5 4 0 1 18 4 0 21 17 0 2 13 17 2 9 4 2 9 4 21 11 1 0 1 20 14 1 8 10 9 0 1 24 24 1 0 4 2 18 2 8 16 15 7 15 1 9 17 11 0 15 2 14 19 21 17 9 12 24 13 13 3 22 6 8 4 0 1 10 0 0 14 6 3 22 0 8 4 10 2 0 8 15 21 22 15 11 0 6 24 1 2 13 19 16 0 4 0 1 0 22 20 13 22 7 1 5 12 0 9 3 16 7 4 19 7 22 4 10 14 19 19 0 5 10 2 8 1 11 10 15 0 21 1 1 3 0 12 5 24 1 23 19 8 3 16 2 24 15 0 3 1 12 1 1 6 10 18 4 0 7 23 10 3 5 18 10 16 8 0 1 0 10 17 18 15 7 0 1 0 0 12 0 3 16 15 5 23 20 13 13 10 0 2 5 1 0 13 13 7 9 17 23 24 1 4 15 19 0 1 14 8 3 8 0 6 19 0 12 17 22 19 14 15 17 2 10 0 1 22 17 11 24 19 11 20 23 8 11 24 3 5 0 12 0 7 5 8 0 1 12 1 22 16 6 24 21 6 1 9 5 2 23 0 20 9 2 1 18 12 24 12 5 20 23 0 14 3 11 1 9 15 1 1 13 24 0 4 1 0 3 1 1 1 14 24 7 20 23 20 14 17 0 7 5 1