My original proposal was a misunderstanding. We do still want to change this though. Haniel proposed a list of options to move forward with this. After discussion seems like the following seems best.
use a list of the terms instantiating the quantifier. For example:(step i (cl (not (forall ((x T) (y T)) (P x y))) (P t1 t2)) :rule forall_inst :args (t1 t2))The downside is that solvers must both instantiate the quantifier fully and pass the terms in the right order.
However, it is not clear how hard it is to change veriT to do so.