Translate the following inference to logic notation: For all x, if x_2 were an electrician, then x_2 is a soldier. For all x, if x_2 were a soldier, then x_2 is sleeping. For all x, if x_2 sleeps, then x_2 is an electrician. There is at least one x for which x_2 is not a soldier. Therefore there is at least one x for which x_2 is not an electrician.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). exists x: ~Q(x). Therefore exists x: ~P(x).