Translate the following inference to logic notation: For all x, if x_7 were a cashier, then x_7 is running. For all x, x_7 will not go running. For all x, if x_7 goes running, then x_7 is listening to a song. For all x, if x_7 goes running, then x_7 is a cashier. For all x, if x_7 listens to a song, then x_7 is a cashier. Therefore for all x, x_7 is not a cashier.
forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: Q(x) -> R(x). forall x: Q(x) -> P(x). forall x: R(x) -> P(x). Therefore forall x: ~P(x).