Translate the following inference to logic notation: For all x, x_5 will play tennis. There is at least one x for which x_5 will not drink water or x_5 is a soldier. For all x, x_5 will drink water or x_5 is curious. For all x, if x_5 were curious, then x_5 is not playing tennis. Therefore there is at least one x for which x_5 is a soldier.
forall x: P(x). exists x: ~Q(x) or R(x). forall x: Q(x) or S(x). forall x: S(x) -> ~P(x). Therefore exists x: R(x).