Term Rewriting System R:
[x, y]
g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
G(f(x, y)) -> G(g(x))
G(f(x, y)) -> G(x)
G(f(x, y)) -> G(g(y))
G(f(x, y)) -> G(y)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
G(f(x, y)) -> G(y)
G(f(x, y)) -> G(g(y))
G(f(x, y)) -> G(x)
G(f(x, y)) -> G(g(x))
Rule:
g(f(x, y)) -> f(f(g(g(x)), g(g(y))), f(g(g(x)), g(g(y))))
Termination of R could not be shown.
Duration:
0:00 minutes