Translate the following inference to logic notation: For all x, x_6 is a carpenter. For all x, if x_6 were a carpenter, then x_6 is working. There is at least one x for which if x_6 were a musician, then x_6 is not playing tennis. For all x, x_6 will play tennis. Therefore there is at least one x for which x_6 is not a musician.
forall x: P(x). forall x: P(x) -> Q(x). exists x: R(x) -> ~S(x). forall x: S(x). Therefore exists x: ~R(x).