Translate the following inference to logic notation: For all x, if x_5 goes running, then x_5 is a janitor. For all x, if x_5 were a mechanic, then x_5 is an electrician. For all x, if x_5 were an electrician, then x_5 is running. For all x, if x_5 makes tea, then x_5 is a mechanic. Therefore for all x, if x_5 makes tea, then x_5 is a janitor.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> P(x). forall x: T(x) -> R(x). Therefore forall x: T(x) -> Q(x).