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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Usable Rules (Innermost)


Dependency Pair:

F(s(x), s(y)) -> F(x, y)


Rules:


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


Strategy:

innermost




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


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
           →DP Problem 2
             ↳Size-Change Principle


Dependency Pair:

F(s(x), s(y)) -> F(x, y)


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. F(s(x), s(y)) -> F(x, y)
and get the following Size-Change Graph(s):
{1} , {1}
1>1
2>2

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1>1
2>2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
s(x1) -> s(x1)

We obtain no new DP problems.

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