Term Rewriting System R:
[x]
f(a, f(x, a)) -> f(a, f(f(a, a), x))

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(a, f(x, a)) -> F(a, f(f(a, a), x))
F(a, f(x, a)) -> F(f(a, a), x)
F(a, f(x, a)) -> F(a, a)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Narrowing Transformation`

Dependency Pairs:

F(a, f(x, a)) -> F(f(a, a), x)
F(a, f(x, a)) -> F(a, f(f(a, a), x))

Rule:

f(a, f(x, a)) -> f(a, f(f(a, a), x))

Strategy:

innermost

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

F(a, f(x, a)) -> F(f(a, a), x)
no new Dependency Pairs are created.
The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Nar`
`           →DP Problem 2`
`             ↳Remaining Obligation(s)`

The following remains to be proven:
Dependency Pair:

F(a, f(x, a)) -> F(a, f(f(a, a), x))

Rule:

f(a, f(x, a)) -> f(a, f(f(a, a), x))

Strategy:

innermost

Innermost Termination of R could not be shown.
Duration:
0:00 minutes