Translate the following inference to logic notation: For all x, x will make tea. For all x, x will not make tea. For all x, if x were an office clerk, then x is not a soldier. Therefore for all x, x is not an office clerk.
forall x: P(x). forall x: ~P(x). forall x: Q(x) -> ~R(x). Therefore forall x: ~Q(x).