Translate the following inference to logic notation: For all x, if x_5 plays a game, then x_5 is curious. For all x, x_5 will play a game or x_5 is a taxi driver. For all x, x_5 will work. For all x, if x_5 were a taxi driver, then x_5 is sleeping. For all x, if x_5 sleeps, then x_5 is curious. Therefore for all x, x_5 will work and x_5 is curious.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: S(x). forall x: R(x) -> T(x). forall x: T(x) -> Q(x). Therefore forall x: S(x) and Q(x).