Translate the following inference to logic notation: For all x, if x_6 were bored, then x_6 is a police officer. There is at least one x for which x_6 is bored. For all x, if x_6 were a police officer, then x_6 is playing squash. For all x, if x_6 cooks, then x_6 is playing squash. Therefore there is at least one x for which x_6 will play squash.
forall x: P(x) -> Q(x). exists x: P(x). forall x: Q(x) -> R(x). forall x: S(x) -> R(x). Therefore exists x: R(x).