aprove is a sprinkler system and Evidence of the innermost termination of term rewriting systems (TRS). Aprove - Automated Program Verification Environment - is a sprinkler system and evidence of the innermost termination of term rewriting systems (TRS). In addition, aprove also manages several other formalisms, for example, the program logic (Prolog), functional programs (Haskell 98), total return swaps suspended, TRS modulo AC, the TRS ConTEXT-sensitive, etc. The power aprove of is shown in the annual international competition Tools dissolution where aprove was the most powerful tool for the termination of total return swaps in 2004, 2005, 2006 and 2007.AProVE is based on the dependency pair framework and offers a wide variety of techniques for different termination proof. These techniques can be freely combined and configured by the user via a graphical user interface. In addition, aprove also offers an "automatic" mode when appropriate suppression techniques are performed in a certain fixed order which is frequently succeed in practice. Requirements: · system version 1.5 or Java Runtime newerINSTALLATION: Unzip the aprove Archive.Start with java-jar AProVE.jarIf aprove accidents due to not enough memory, you should start with aprove XmxNm option, which allows Java and then use aprove N megabytes of memory. For example, java-Xmx400m-jar AProVE.jarstarts aprove with a memory limit of 400 megabytes. Without this option the default limit is used, which is quite low.