Translate the following inference to logic notation: For all x, x_9 is not a taxi driver. For all x, if x_9 cooks, then x_9 is happy. For all x, if x_9 were a carpenter, then x_9 is happy. For all x, if x_9 were happy, then x_9 is a carpenter. For all x, x_9 is a carpenter if and only if x_9 is a taxi driver. Therefore for all x, x_9 will not cook.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: S(x) -> R(x). forall x: R(x) -> S(x). forall x: S(x) <-> P(x). Therefore forall x: ~Q(x).