Translate the following inference to logic notation: For all x, x_15 will drink water or x_15 is a carpenter. For all x, x_15 will not drink water or x_15 will play tennis. There is at least one x for which if x_15 were an office clerk, then x_15 is a taxi driver. For all x, x_15 is a server if and only if x_15 is a carpenter. For all x, if x_15 plays tennis, then x_15 is a taxi driver. For all x, if x_15 were a server, then x_15 is an office clerk. Therefore there is at least one x for which x_15 is a taxi driver.
forall x: P(x) or Q(x). forall x: ~P(x) or R(x). exists x: S(x) -> T(x). forall x: U(x) <-> Q(x). forall x: R(x) -> T(x). forall x: U(x) -> S(x). Therefore exists x: T(x).