RegSTAB is a SAT-solver able to deal with formula schemata.

i.e. you can give it a scheme of formula such as "/\i=1..n P_i -> P_i+1" and it will be able to answer you if *all the formulas of this form (i.e. for every value of n) are unsatisfiable*.