Translate the following inference to logic notation: For all x, if x_17 were a taxi driver, then x_17 is not curious. For all x, x_17 is happy or x_17 is a scientist. There is at least one x for which x_17 is curious if and only if x_17 is happy. For all x, x_17 is a scientist if and only if x_17 is curious. Therefore there is at least one x for which x_17 is not a taxi driver.
forall x: P(x) -> ~Q(x). forall x: R(x) or S(x). exists x: Q(x) <-> R(x). forall x: S(x) <-> Q(x). Therefore exists x: ~P(x).