Translate the following inference to logic notation: For all x, if x_13 cooks, then x_13 is making tea. For all x, x_13 is not excited. For all x, x_13 will take a plane if and only if x_13 will make tea. For all x, if x_13 takes a plane, then x_13 is excited. For all x, if x_13 were excited, then x_13 is taking a plane. Therefore for all x, x_13 will not cook.
forall x: P(x) -> Q(x). forall x: ~R(x). forall x: S(x) <-> Q(x). forall x: S(x) -> R(x). forall x: R(x) -> S(x). Therefore forall x: ~P(x).