Translate the following inference to logic notation: For all x, x_11 will sleep or x_11 will climb a mountain. For all x, if x_11 climbs a mountain, then x_11 is cooking. For all x, x_11 will cook if and only if x_11 will play tennis. For all x, x_11 will play tennis if and only if x_11 will sleep. Therefore for all x, x_11 will play tennis.
forall x: P(x) or Q(x). forall x: Q(x) -> R(x). forall x: R(x) <-> S(x). forall x: S(x) <-> P(x). Therefore forall x: S(x).