Translate the following inference to logic notation: For all x, if x_3 goes running, then x_3 is a taxi driver. For all x, x_3 is excited. For all x, if x_3 were excited, then x_3 is running. There is at least one x for which if x_3 were poor, then x_3 is a taxi driver. Therefore there is at least one x for which x_3 is a taxi driver.
forall x: P(x) -> Q(x). forall x: R(x). forall x: R(x) -> P(x). exists x: S(x) -> Q(x). Therefore exists x: Q(x).