Term Rewriting System R:
[x]
f(f(x)) -> f(c(f(x)))
f(f(x)) -> f(d(f(x)))
g(c(x)) -> x
g(d(x)) -> x
g(c(0)) -> g(d(1))
g(c(1)) -> g(d(0))
Innermost Termination of R to be shown.
TRS
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(f(x)) -> F(c(f(x)))
F(f(x)) -> F(d(f(x)))
G(c(0)) -> G(d(1))
G(c(1)) -> G(d(0))
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes