Translate the following inference to logic notation: For all x, if y_1 goes running, then y_1 is a soldier. For all x, y_1 is a soldier if and only if y_1 will go running. For all x, y_1 is not a soldier. Therefore for all x, y_1 will not go running.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). forall x: ~Q(x). Therefore forall x: ~P(x).