Translate the following inference to logic notation: For all x, x_5 is a server. For all x, if x_5 goes running, then x_5 is a writer. For all x, if x_5 takes a plane, then x_5 is running. For all x, x_5 will take a plane. Therefore for all x, x_5 is a writer and x_5 is a server.
forall x: P(x). forall x: Q(x) -> R(x). forall x: S(x) -> Q(x). forall x: S(x). Therefore forall x: R(x) and P(x).