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