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

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, f(a, a)), a), x)
F(f(x, a), a) -> F(f(a, f(a, a)), a)
F(f(x, a), a) -> F(a, f(a, a))
F(f(x, a), a) -> F(a, a)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Semantic Labelling


Dependency Pair:

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


Rule:


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





Using Semantic Labelling, the DP problem could be transformed. The following model was found:
F(x0, x1)=  0
f(x0, x1)=  0
a=  0

From the dependency graph we obtain 1 (labeled) SCCs which each result in correspondingDP problem.


   R
     ↳DPs
       →DP Problem 1
         ↳SemLab
           →DP Problem 2
             ↳Modular Removal of Rules


Dependency Pair:

F00(f00(x, a), a) -> F00(f00(f00(a, f00(a, a)), a), x)


Rules:


f00(f00(x, a), a) -> f00(f00(f00(a, f00(a, a)), a), x)
f00(f10(x, a), a) -> f01(f00(f00(a, f00(a, a)), a), x)





We have the following set of usable rules: none
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(F_00(x1, x2))=  1 + x1 + x2  
  POL(f_00(x1, x2))=  x1 + x2  
  POL(a)=  0  

We have the following set D of usable symbols: {F00, f00, a}
No Dependency Pairs can be deleted.
2 non usable rules have been deleted.

The result of this processor delivers one new DP problem.



   R
     ↳DPs
       →DP Problem 1
         ↳SemLab
           →DP Problem 2
             ↳MRR
             ...
               →DP Problem 3
                 ↳Unlabel


Dependency Pair:

F00(f00(x, a), a) -> F00(f00(f00(a, f00(a, a)), a), x)


Rule:

none





Removed all semantic labels.

   R
     ↳DPs
       →DP Problem 1
         ↳SemLab
           →DP Problem 2
             ↳MRR
             ...
               →DP Problem 4
                 ↳Instantiation Transformation


Dependency Pair:

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


Rule:

none





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

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

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

The transformation is resulting in no new DP problems.


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