Translate the following inference to logic notation: For all x, if x_8 works, then x_8 is driving a car. For all x, if x_8 drives a car, then x_8 is playing tennis. There is at least one x for which if x_8 works, then x_8 is cooking. For all x, if x_8 cooks, then x_8 is working. Therefore there is at least one x for which if x_8 cooks, then x_8 is playing tennis.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: P(x) -> S(x). forall x: S(x) -> P(x). Therefore exists x: S(x) -> R(x).