Term Rewriting System R:
[x, y]
a(a(f(x, y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) -> a(f(x, y))
f(b(x), b(y)) -> b(f(x, y))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

A(a(f(x, y))) -> F(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
A(a(f(x, y))) -> A(b(a(b(a(x)))))
A(a(f(x, y))) -> A(b(a(x)))
A(a(f(x, y))) -> A(x)
A(a(f(x, y))) -> A(b(a(b(a(y)))))
A(a(f(x, y))) -> A(b(a(y)))
A(a(f(x, y))) -> A(y)
F(a(x), a(y)) -> A(f(x, y))
F(a(x), a(y)) -> F(x, y)
F(b(x), b(y)) -> F(x, y)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

F(b(x), b(y)) -> F(x, y)
F(a(x), a(y)) -> F(x, y)
A(a(f(x, y))) -> A(y)
A(a(f(x, y))) -> A(x)
F(a(x), a(y)) -> A(f(x, y))
A(a(f(x, y))) -> F(a(b(a(b(a(x))))), a(b(a(b(a(y))))))


Rules:


a(a(f(x, y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))
f(a(x), a(y)) -> a(f(x, y))
f(b(x), b(y)) -> b(f(x, y))


Strategy:

innermost



Innermost Termination of R could not be shown.
Duration:
0:00 minutes