Term Rewriting System R:
[]
app(f, 0) -> app(f, 0)
0 -> 1

Innermost Termination of R to be shown. 



   R
     ↳Removing Redundant Rules for Innermost Termination



Removing the following rules from R which left hand sides contain non normal subterms

app(f, 0) -> app(f, 0)


   R
     ↳RRRI
       →TRS2
         ↳Removing Redundant Rules



Removing the following rules from R which fullfill a polynomial ordering:

0 -> 1

where the Polynomial interpretation:
  POL(0)=  1  
  POL(1)=  0  
was used.

All Rules of R can be deleted. 


   R
     ↳RRRI
       →TRS2
         ↳RRRPolo
           →TRS3
             ↳Dependency Pair Analysis



R contains no Dependency Pairs and therefore no SCCs.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes