Term Rewriting System R:
[x]
a(b(x)) -> b(b(a(x)))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
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 Pair:
A(b(x)) -> A(x)
Rule:
a(b(x)) -> b(b(a(x)))
Termination of R could not be shown.
Duration:
0:00 minutes