YES
Termination Proof
Termination Proof
by ttt2 (version ttt2 1.15)
Input
The rewrite relation of the following TRS is considered.
| 
b(b(a(b(x0)))) | 
→ | 
b(a(b(b(b(b(x0)))))) | 
| 
b(a(b(b(x0)))) | 
→ | 
b(b(b(x0))) | 
| 
b(b(b(x0))) | 
→ | 
b(b(a(a(b(a(b(x0))))))) | 
Proof
1 String Reversal
        Since only unary symbols occur, one can reverse all terms and obtains the TRS        
        
| 
b(a(b(b(x0)))) | 
→ | 
b(b(b(b(a(b(x0)))))) | 
| 
b(b(a(b(x0)))) | 
→ | 
b(b(b(x0))) | 
| 
b(b(b(x0))) | 
→ | 
b(a(b(a(a(b(b(x0))))))) | 
1.1 Dependency Pair Transformation
          The following set of initial dependency pairs has been identified.
          
| 
b#(a(b(b(x0)))) | 
→ | 
b#(a(b(x0))) | 
| 
b#(a(b(b(x0)))) | 
→ | 
b#(b(a(b(x0)))) | 
| 
b#(a(b(b(x0)))) | 
→ | 
b#(b(b(a(b(x0))))) | 
| 
b#(a(b(b(x0)))) | 
→ | 
b#(b(b(b(a(b(x0)))))) | 
| 
b#(b(a(b(x0)))) | 
→ | 
b#(b(x0)) | 
| 
b#(b(a(b(x0)))) | 
→ | 
b#(b(b(x0))) | 
| 
b#(b(b(x0))) | 
→ | 
b#(a(a(b(b(x0))))) | 
| 
b#(b(b(x0))) | 
→ | 
b#(a(b(a(a(b(b(x0))))))) | 
1.1.1 Dependency Graph Processor
The dependency pairs are split into 2
        components.