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: There is at least one x_9 for which if x_9 were curious, then x_9 is running. For all x_9, x_9 is curious or x_9 will not go running. For all x_9, if x_9 were curious, then x_9 is running.
For all x_9, if x_9 goes running, then x_9 is curious can be inferred via the universal rewriting rule.