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