Translate the following inference to logic notation: For all x, if x_6 were bored, then x_6 is working. For all x, if x_6 makes tea, then x_6 is drinking water. For all x, x_6 will make tea or x_6 will play squash. There is at least one x for which if x_6 drinks water, then x_6 is working. For all x, if x_6 plays squash, then x_6 is bored. Therefore there is at least one x for which x_6 will work.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: R(x) or T(x). exists x: S(x) -> Q(x). forall x: T(x) -> P(x). Therefore exists x: Q(x).