Translate the following inference to logic notation: For all x, x_6 is not an office clerk. For all x, x_6 is an office clerk or x_6 will climb a mountain. For all x, x_6 will play tennis if and only if x_6 is bored. For all x, if x_6 were bored, then x_6 is not climbing a mountain. Therefore for all x, x_6 will not play tennis.
forall x: ~P(x). forall x: P(x) or Q(x). forall x: R(x) <-> S(x). forall x: S(x) -> ~Q(x). Therefore forall x: ~R(x).