Term Rewriting System R:

   [x]
   a(b(a(b(x)))) -> b(a(b(a(a(b(x))))))

Innermost Termination of R to be shown.


R contains the following Dependency Pairs: 


   A(b(a(b(x)))) -> A(b(a(a(b(x)))))
   A(b(a(b(x)))) -> A(a(b(x)))

Furthermore, R contains one SCC.


SCC1:

A(b(a(b(x)))) -> A(b(a(a(b(x)))))

On this Scc, a Narrowing SCC transformation can be performed.
 
As a result of transforming the rule 

   A(b(a(b(x)))) -> A(b(a(a(b(x)))))
no new Dependency Pairs
are created.

none
The transformation is resulting in no subcycles.




Innermost Termination of R successfully shown.


Duration: 0.871 seconds.