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