Translate the following inference to logic notation: For all x, if x_5 plays a game, then x_5 is bored. For all x, if x_5 were bored, then x_5 is driving a car. For all x, if x_5 goes running, then x_5 is playing a game. For all x, x_5 will not drive a car. Therefore for all x, x_5 will not go running.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> P(x). forall x: ~R(x). Therefore forall x: ~S(x).