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

Termination of R to be shown. 



   R
     ↳Removing Redundant Rules



Removing the following rules from R which fullfill a polynomial ordering:

f(x, y) -> x
f(i(x), i(g(x))) -> a

where the Polynomial interpretation:
  POL(i(x1))=  x1  
  POL(g(x1))=  x1  
  POL(a)=  0  
  POL(f(x1, x2))=  1 + x1 + x2  
was used.

Not all Rules of R can be deleted, so we still have to regard a part of R. 


   R
     ↳RRRPolo
       →TRS2
         ↳Overlay and local confluence Check



The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost. 


   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(x, i(x)) -> F(x, x)
F(x, x) -> F(i(x), g(g(x)))
F(x, x) -> G(g(x))
F(x, x) -> G(x)

Furthermore, R contains one SCC. 


   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳DPs
             ...
               →DP Problem 1
                 ↳Usable Rules (Innermost)


Dependency Pairs:

F(x, x) -> F(i(x), g(g(x)))
F(x, i(x)) -> F(x, x)


Rules:


g(x) -> i(x)
f(x, i(x)) -> f(x, x)
f(x, x) -> f(i(x), g(g(x)))


Strategy:

innermost




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


   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳DPs
             ...
               →DP Problem 2
                 ↳Rewriting Transformation


Dependency Pairs:

F(x, x) -> F(i(x), g(g(x)))
F(x, i(x)) -> F(x, x)


Rule:


g(x) -> i(x)


Strategy:

innermost




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

F(x, x) -> F(i(x), g(g(x)))
one new Dependency Pair is created:

F(x, x) -> F(i(x), i(g(x)))

The transformation is resulting in one new DP problem: 



   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳DPs
             ...
               →DP Problem 3
                 ↳Rewriting Transformation


Dependency Pairs:

F(x, x) -> F(i(x), i(g(x)))
F(x, i(x)) -> F(x, x)


Rule:


g(x) -> i(x)


Strategy:

innermost




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

F(x, x) -> F(i(x), i(g(x)))
one new Dependency Pair is created:

F(x, x) -> F(i(x), i(i(x)))

The transformation is resulting in one new DP problem: 



   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳DPs
             ...
               →DP Problem 4
                 ↳Usable Rules (Innermost)


Dependency Pairs:

F(x, x) -> F(i(x), i(i(x)))
F(x, i(x)) -> F(x, x)


Rule:


g(x) -> i(x)


Strategy:

innermost




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


   R
     ↳RRRPolo
       →TRS2
         ↳OC
           →TRS3
             ↳DPs
             ...
               →DP Problem 5
                 ↳Non Termination


Dependency Pairs:

F(x, x) -> F(i(x), i(i(x)))
F(x, i(x)) -> F(x, x)


Rule:

none


Strategy:

innermost




Found an infinite P-chain over R:
P =

F(x, x) -> F(i(x), i(i(x)))
F(x, i(x)) -> F(x, x)

R = none

s = F(x'', i(x''))
evaluates to t =F(i(x''), i(i(x'')))

Thus, s starts an infinite chain as s matches t.

Non-Termination of R could be shown.
Duration:
0:00 minutes