Translate the following inference to logic notation: For all x, if x_12 cooks, then x_12 is playing tennis. For all x, x_12 is bored if and only if x_12 will read a book. For all x, x_12 is not bored. For all x, if x_12 plays tennis, then x_12 is reading a book. Therefore for all x, x_12 will not cook.
forall x: P(x) -> Q(x). forall x: R(x) <-> S(x). forall x: ~R(x). forall x: Q(x) -> S(x). Therefore forall x: ~P(x).