What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: For all x_6, x_6 will make tea or x_6 will not work. There is at least one x_6 for which x_6 will work. For all x_6, if x_6 makes tea, then x_6 is sleeping.
For all x_6, if x_6 works, then x_6 is making tea can be inferred via the universal rewriting rule.