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