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