Translate the following inference to logic notation: For all x, if x_5 were bored, then x_5 is a server. For all x, x_5 is not a server. For all x, x_5 will cook if and only if x_5 will drive a car. For all x, if x_5 drives a car, then x_5 is bored. Therefore for all x, x_5 will not cook.
forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: R(x) <-> S(x). forall x: S(x) -> P(x). Therefore forall x: ~R(x).