Term Rewriting System R:
[x]
f(s(0), g(x)) -> f(x, g(x))
g(s(x)) -> g(x)

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(s(0), g(x)) -> F(x, g(x))
G(s(x)) -> G(x)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering
       →DP Problem 2
         ↳FwdInst


Dependency Pair:

G(s(x)) -> G(x)


Rules:


f(s(0), g(x)) -> f(x, g(x))
g(s(x)) -> g(x)





The following dependency pair can be strictly oriented:

G(s(x)) -> G(x)


There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(G(x1))=  x1  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 3
             ↳Dependency Graph
       →DP Problem 2
         ↳FwdInst


Dependency Pair:


Rules:


f(s(0), g(x)) -> f(x, g(x))
g(s(x)) -> g(x)





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Forward Instantiation Transformation


Dependency Pair:

F(s(0), g(x)) -> F(x, g(x))


Rules:


f(s(0), g(x)) -> f(x, g(x))
g(s(x)) -> g(x)





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

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

F(s(0), g(s(0))) -> F(s(0), g(s(0)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳FwdInst
           →DP Problem 4
             ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

F(s(0), g(s(0))) -> F(s(0), g(s(0)))


Rules:


f(s(0), g(x)) -> f(x, g(x))
g(s(x)) -> g(x)




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