Translate the following inference to logic notation: For all x, x is a musician or x is happy. For all x, x is not happy or x is a server. For all x, x is not a musician or x will climb a mountain. For all x, if x were a server, then x is an electrician. For all x, if x climbs a mountain, then x is an electrician. Therefore for all x, x is an electrician.
forall x: P(x) or Q(x). forall x: ~Q(x) or R(x). forall x: ~P(x) or S(x). forall x: R(x) -> T(x). forall x: S(x) -> T(x). Therefore forall x: T(x).