Translate the following inference to logic notation: For all x, if x_3 drives a car, then x_3 is a writer. For all x, x_3 is a writer or x_3 will not work. There is at least one x for which x_3 will drive a car or x_3 will play a game. For all x, if x_3 plays a game, then x_3 is working. Therefore there is at least one x for which x_3 is a writer.
forall x: P(x) -> Q(x). forall x: Q(x) or ~R(x). exists x: P(x) or S(x). forall x: S(x) -> R(x). Therefore exists x: Q(x).