Translate the following inference to logic notation: For all x, x_10 is a writer if and only if x_10 will go running. For all x, if x_10 drives a car, then x_10 is running. For all x, x_10 will drive a car or x_10 will not play a game. Therefore for all x, if x_10 plays a game, then x_10 is a writer.
forall x: P(x) <-> Q(x). forall x: R(x) -> Q(x). forall x: R(x) or ~S(x). Therefore forall x: S(x) -> P(x).