Term Rewriting System R:
[x]
p(f(f(x))) -> q(f(g(x)))
p(g(g(x))) -> q(g(f(x)))
q(f(f(x))) -> p(f(g(x)))
q(g(g(x))) -> p(g(f(x)))
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
P(f(f(x))) -> Q(f(g(x)))
P(g(g(x))) -> Q(g(f(x)))
Q(f(f(x))) -> P(f(g(x)))
Q(g(g(x))) -> P(g(f(x)))
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes