Term Rewriting System R:
[x]
f(x, x) -> f(a, b)
b -> c
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(x, x) -> F(a, b)
F(x, x) -> B
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Narrowing Transformation
Dependency Pair:
F(x, x) -> F(a, b)
Rules:
f(x, x) -> f(a, b)
b -> c
On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule
F(x, x) -> F(a, b)
one new Dependency Pair
is created:
F(x, x) -> F(a, c)
The transformation is resulting in no new DP problems.
Termination of R successfully shown.
Duration:
0:00 minutes