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

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC.

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

Dependency Pairs:

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

Rule:

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

Strategy:

innermost

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

F(x, f(a, a)) -> F(a, f(f(f(a, a), a), x))
one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

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

Dependency Pairs:

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

Rule:

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

Strategy:

innermost

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

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

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

The following remains to be proven:
Dependency Pair:

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

Rule:

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

Strategy:

innermost

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