Translate the following inference to logic notation: For all x, x_5 will go running. For all x, if x_5 were a taxi driver, then x_5 is an electrician. There is at least one x for which x_5 is a taxi driver. Therefore there is at least one x for which x_5 will go running.
forall x: P(x). forall x: Q(x) -> R(x). exists x: Q(x). Therefore exists x: P(x).