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