What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? For all x, x will not go running. For all x, if x makes tea, then x is working. For all x, x will go running or x will not work.
For all x, if x works, then x is running.