Translate the following inference to logic notation: For all x, if x_23 sleeps, then x_23 is making tea. Sarah is sleeping. For all x, if x_23 makes tea, then x_23 is a soldier. For all x, if x_23 were a soldier, then x_23 is making tea. Therefore there is at least one x for which x_23 is a soldier.
forall x: P(x) -> Q(x). P(a). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). Therefore exists x: R(x).