Translate the following inference to logic notation: There is at least one x for which if x_5 cooks, then x_5 is playing a game. For all x, if x_5 drives a car, then x_5 is reading a book. For all x, x_5 will drive a car. For all x, if x_5 reads a book, then x_5 is playing a game. Therefore there is at least one x for which x_5 will play a game.
exists x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: R(x). forall x: S(x) -> Q(x). Therefore exists x: Q(x).