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
↳Dependency Pair Analysis
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.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
A(b(a(b(x)))) -> A(b(a(a(b(x)))))
Rule:
a(b(a(b(x)))) -> b(a(b(a(a(b(x))))))
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes