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

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Usable Rules (Innermost)`

Dependency Pair:

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

Rule:

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

Strategy:

innermost

As we are in the innermost case, we can delete all 1 non-usable-rules.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳UsableRules`
`           →DP Problem 2`
`             ↳Instantiation Transformation`

Dependency Pair:

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

Rule:

none

Strategy:

innermost

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

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

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

The transformation is resulting in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes