Translate the following inference to logic notation: For all x, if x_9 were a janitor, then x_9 is making tea. For all x, if x_9 were a sailor, then x_9 is sleeping. For all x, x_9 will sleep or x_9 is not sad. For all x, if x_9 makes tea, then x_9 is a sailor. There is at least one x for which x_9 is a janitor or x_9 is sad. Therefore there is at least one x for which x_9 will sleep.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) or ~T(x). forall x: Q(x) -> R(x). exists x: P(x) or T(x). Therefore exists x: S(x).