Term Rewriting System R:
[x]
a(b(x)) -> b(b(a(a(x))))
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
A(b(x)) -> A(a(x))
A(b(x)) -> A(x)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
A(b(x)) -> A(x)
A(b(x)) -> A(a(x))
Rule:
a(b(x)) -> b(b(a(a(x))))
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes