Translate the following inference to logic notation: For all x, if x_5 were a mechanic, then x_5 is a server. There is at least one x for which if x_5 goes running, then x_5 is curious. For all x, if x_5 were a server, then x_5 is curious. For all x, x_5 is a mechanic. Therefore there is at least one x for which x_5 is curious.
forall x: P(x) -> Q(x). exists x: R(x) -> S(x). forall x: Q(x) -> S(x). forall x: P(x). Therefore exists x: S(x).