Translate the following inference to logic notation: For all x, if x_11 cooks, then x_11 is curious. For all x, x_11 will work. For all x, x_11 is a server if and only if x_11 is curious. For all x, x_11 is a doctor if and only if x_11 is a server. For all x, if x_11 were a doctor, then x_11 is not working. For all x, if x_11 were curious, then x_11 is cooking. Therefore for all x, x_11 will not cook.
forall x: P(x) -> Q(x). forall x: R(x). forall x: S(x) <-> Q(x). forall x: T(x) <-> S(x). forall x: T(x) -> ~R(x). forall x: Q(x) -> P(x). Therefore forall x: ~P(x).