Translate the following inference to logic notation: For all x, if x_9 were a server, then x_9 is sad. For all x, if x_9 were an artist, then x_9 is writing a letter. For all x, if x_9 drives a car, then x_9 is writing a letter. There is at least one x for which if x_9 writes a letter, then x_9 is a server. For all x, x_9 will drive a car or x_9 is an artist. Therefore there is at least one x for which x_9 is sad.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: T(x) -> S(x). exists x: S(x) -> P(x). forall x: T(x) or R(x). Therefore exists x: Q(x).