Translate the following inference to logic notation: For all x, x_8 will not read a book. For all x, x_8 will not work or x_8 will climb a mountain. For all x, x_8 is a server or x_8 will work. For all x, x_8 is not a server or x_8 will read a book. Therefore Thomas is climbing a mountain.
forall x: ~P(x). forall x: ~Q(x) or R(x). forall x: S(x) or Q(x). forall x: ~S(x) or P(x). Therefore R(a).