Translate the following inference to logic notation: For all x, if x_5 were a taxi driver, then x_5 is climbing a mountain. For all x, if x_5 sleeps, then x_5 is a taxi driver. For all x, x_5 will sleep. There is at least one x for which if x_5 were a police officer, then x_5 is climbing a mountain. Therefore there is at least one x for which x_5 will climb a mountain.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: R(x). exists x: S(x) -> Q(x). Therefore exists x: Q(x).