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