Translate the following inference to logic notation: For all x, x_7 will listen to a song or x_7 will not go running. For all x, if x_7 makes tea, then x_7 is working. There is at least one x for which if x_7 works, then x_7 is running. Therefore there is at least one x for which if x_7 makes tea, then x_7 is listening to a song.
forall x: P(x) or ~Q(x). forall x: R(x) -> S(x). exists x: S(x) -> Q(x). Therefore exists x: R(x) -> P(x).