Translate the following inference to logic notation: For all x, if x_5 drives a car, then x_5 is not a scientist. For all x, x_5 is a scientist. For all x, if x_5 makes tea, then x_5 is driving a car. There is at least one x for which if x_5 were a soldier, then x_5 is making tea. Therefore there is at least one x for which x_5 is not a soldier.
forall x: P(x) -> ~Q(x). forall x: Q(x). forall x: R(x) -> P(x). exists x: S(x) -> R(x). Therefore exists x: ~S(x).