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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(s(x)) -> F(x)
G(s(0)) -> G(f(s(0)))
G(s(0)) -> F(s(0))

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering
       →DP Problem 2
         ↳FwdInst


Dependency Pair:

F(s(x)) -> F(x)


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(s(x)) -> F(x)


There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
F(x1) -> F(x1)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pair:

G(s(0)) -> G(f(s(0)))


Rules:


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


Strategy:

innermost




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

G(s(0)) -> G(f(s(0)))
no new Dependency Pairs are created.
The transformation is resulting in no new DP problems.


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