Consider the TRS R consisting of the rewrite rule

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

There are 2 dependency pairs:

2: F(a,f(f(a,x),a)) -> F(f(a,f(a,x)),a)
3: F(a,f(f(a,x),a)) -> F(a,f(a,x))

The approximated dependency graph contains one SCC:
{3}.

- Consider the SCC {3}.
By taking the polynomial interpretation
[a] = 1
and [f](x,y) = [F](x,y) = x + y + 1,
rule 1
is weakly decreasing and
rule 3
is strictly decreasing.

Hence the TRS is terminating.