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