Translate the following inference to logic notation: For all x, if x_4 makes tea, then x_4 is sleeping. For all x, if x_4 sleeps, then x_4 is driving a car. For all x, if x_4 were an office clerk, then x_4 is making tea. For all x, if x_4 drives a car, then x_4 is an artist. Therefore for all x, if x_4 were an office clerk, then x_4 is an artist.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> P(x). forall x: R(x) -> T(x). Therefore forall x: S(x) -> T(x).