Translate the following inference to logic notation: For all x, y is not a server. For all x, if y were a taxi driver, then y is a musician. For all x, y is a server if and only if y is a musician. For all x, if y were a musician, then y is a taxi driver. Therefore for all x, y is not a taxi driver.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) <-> R(x). forall x: R(x) -> Q(x). Therefore forall x: ~Q(x).