Translate the following inference to logic notation: There is at least one x for which if x_3 were a taxi driver, then x_3 is not a carpenter. For all x, x_3 is a carpenter and x_3 will play tennis. Therefore there is at least one x for which x_3 is not a taxi driver.
exists x: P(x) -> ~Q(x). forall x: Q(x) and R(x). Therefore exists x: ~P(x).