Translate the following inference to logic notation: For all x, if x_9 were bored, then x_9 is playing a game. For all x, x_9 will not go running. For all x, x_9 is bored. For all x, x_9 will go running or x_9 is a lawyer. Therefore Linda is a lawyer.
forall x: P(x) -> Q(x). forall x: ~R(x). forall x: P(x). forall x: R(x) or S(x). Therefore S(a).