Translate the following inference to logic notation: For all x, x_15 is not a lawyer or x_15 will drive a car. There is at least one x for which if x_15 writes a letter, then x_15 is playing a game. For all x, if x_15 takes a plane, then x_15 is writing a letter. For all x, x_15 is a lawyer or x_15 is a writer. For all x, x_15 will take a plane if and only if x_15 is a writer. For all x, if x_15 drives a car, then x_15 is playing a game. Therefore there is at least one x for which x_15 will play a game.
forall x: ~P(x) or Q(x). exists x: R(x) -> S(x). forall x: T(x) -> R(x). forall x: P(x) or U(x). forall x: T(x) <-> U(x). forall x: Q(x) -> S(x). Therefore exists x: S(x).