Translate the following inference to logic notation: For all x, if x_14 drives a car, then x_14 is cooking. For all x, x_14 will not go running. For all x, x_14 is bored if and only if x_14 will drive a car. William is a police officer if and only if Jennifer is bored. For all x, if x_14 cooks, then x_14 is running. Therefore William is not a police officer.
forall x: P(x) -> Q(x). forall x: ~R(x). forall x: S(x) <-> P(x). p <-> S(a). forall x: Q(x) -> R(x). Therefore ~p.