Translate the following inference to logic notation: For all x, x_5 is not a taxi driver. For all x, if x_5 were curious, then x_5 is a taxi driver. For all x, if x_5 were a nurse, then x_5 is a server. For all x, if x_5 were a server, then x_5 is curious. Therefore for all x, x_5 is not a nurse.
forall x: ~P(x). forall x: Q(x) -> P(x). forall x: R(x) -> S(x). forall x: S(x) -> Q(x). Therefore forall x: ~R(x).