Translate the following inference to logic notation: For all x, if x_7 plays tennis, then x_7 is working. For all x, if x_7 listens to a song, then x_7 is a bartender. For all x, x_7 is not a police officer or x_7 will listen to a song. For all x, x_7 is a police officer or x_7 will play tennis. For all x, if x_7 works, then x_7 is a bartender. Therefore Jennifer is a bartender.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: ~T(x) or R(x). forall x: T(x) or P(x). forall x: Q(x) -> S(x). Therefore S(a).