AProVE currently offers many transformation techniques, basic termination techniques (including recursive path orders, Knut Bendix orders, polynomial orders, RFC Matchbounds), dependency pairs including recent refinements such as narrowing, rewriting, and instantiation of dependency pairs, and the size-change principle, also in combination with dependency pairs.
The tool is written in Java and proofs can be performed both in a fully automated or in an interactive mode via a graphical user interface.