Translate the following inference to logic notation: There is at least one x for which if x_8 plays a game, then x_8 is an office clerk. For all x, if x_8 were fast, then x_8 is playing a game. For all x, x_8 is not fast. For all x, if x_8 were an electrician, then x_8 is fast. For all x, if x_8 were an office clerk, then x_8 is an electrician. Therefore there is at least one x for which x_8 is not an office clerk.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~R(x). forall x: S(x) -> R(x). forall x: Q(x) -> S(x). Therefore exists x: ~Q(x).