Translate the following inference to logic notation: For all x, x_6 is fast. For all x, x_6 will play a game or x_6 is not a mechanic. For all x, if x_6 were bored, then x_6 is playing a game. For all x, x_6 is bored or x_6 is a mechanic. Therefore for all x, x_6 will play a game and x_6 is fast.
forall x: P(x). forall x: Q(x) or ~R(x). forall x: S(x) -> Q(x). forall x: S(x) or R(x). Therefore forall x: Q(x) and P(x).