INSTANCE_T_CONV : ((term -> term list) -> conv -> conv)
The first argument should be a function which computes a list of subterms of a term which are syntactically unacceptable to the proof procedure. This function should include in its result any variables that do not appear in other subterms returned. The second argument is the proof procedure to be generalised; this should be a conversion which when successful returns an equation between the argument formula and T (true).
#FORALL_ARITH_CONV "!f m (n:num). (m < (f n)) ==> (m <= (f n))";; evaluation failed FORALL_ARITH_CONV -- formula not in the allowed subset #INSTANCE_T_CONV non_presburger_subterms FORALL_ARITH_CONV # "!f m (n:num). (m < (f n)) ==> (m <= (f n))";; |- (!f m n. m < (f n) ==> m <= (f n)) = T