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

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Narrowing Transformation


Dependency Pairs:

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


Rule:


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





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

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

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

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

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


Rule:


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





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), f(a, x))
one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 3
                 ↳Narrowing Transformation


Dependency Pairs:

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


Rule:


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





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

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

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 4
                 ↳Narrowing Transformation


Dependency Pairs:

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


Rule:


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





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

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

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 5
                 ↳Forward Instantiation Transformation


Dependency Pairs:

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


Rule:


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





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

F(a, f(f(f(x', a), a), a)) -> F(f(a, a), f(a, f(f(a, a), f(a, f(f(a, a), f(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
             ↳Nar
             ...
               →DP Problem 6
                 ↳Polynomial Ordering


Dependency Pairs:

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


Rule:


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





The following dependency pairs can be strictly oriented:

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


Additionally, the following usable rule w.r.t. to the implicit AFS can be oriented:

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


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(a)=  0  
  POL(f(x1, x2))=  1 + x1  
  POL(F(x1, x2))=  x1 + x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 7
                 ↳Dependency Graph


Dependency Pair:


Rule:


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





Using the Dependency Graph resulted in no new DP problems.

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