Translate the following inference to logic notation: For all x, x_11 is a poet if and only if x_11 will cook. For all x, if x_11 were curious, then x_11 is cooking. For all x, x_11 is a poet or x_11 will take a plane. For all x, if x_11 takes a plane, then x_11 is curious. Therefore for all x, x_11 will cook or x_11 is poor.
forall x: P(x) <-> Q(x). forall x: R(x) -> Q(x). forall x: P(x) or S(x). forall x: S(x) -> R(x). Therefore forall x: Q(x) or T(x).