Translate the following inference to logic notation: For all x, x_16 will listen to a song if and only if x_16 is a writer. For all x, x_16 is not a writer. For all x, x_16 will drive a car if and only if x_16 is a server. For all x, x_16 will listen to a song if and only if x_16 will drive a car. There is at least one x for which x_16 is a sailor if and only if x_16 is a server. Therefore there is at least one x for which x_16 is not a sailor.
forall x: P(x) <-> Q(x). forall x: ~Q(x). forall x: R(x) <-> S(x). forall x: P(x) <-> R(x). exists x: T(x) <-> S(x). Therefore exists x: ~T(x).