Translate the following inference to logic notation: For all x, if x_13 were excited, then x_13 is playing tennis. Joseph is a janitor. For all x, x_13 is excited or x_13 will play squash. For all x, if x_13 plays squash, then x_13 is playing tennis. Therefore there is at least one x for which x_13 will play tennis and x_13 is a janitor.
forall x: P(x) -> Q(x). R(a). forall x: P(x) or S(x). forall x: S(x) -> Q(x). Therefore exists x: Q(x) and R(x).