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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

PLUS(x, s(y)) -> PLUS(x, y)
F(0, s(0), x) -> F(x, plus(x, x), x)
F(0, s(0), x) -> PLUS(x, x)

Furthermore, R contains two SCCs. 


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


Dependency Pair:

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


Rules:


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


Strategy:

innermost




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


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


Dependency Pair:

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


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. PLUS(x, s(y)) -> PLUS(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. 


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


Dependency Pair:

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


Rules:


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


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
         ↳UsableRules
           →DP Problem 4
             ↳Narrowing Transformation


Dependency Pair:

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


Rules:


plus(x, s(y)) -> s(plus(x, y))
plus(x, 0) -> x


Strategy:

innermost




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

F(0, s(0), x) -> F(x, plus(x, x), x)
two new Dependency Pairs are created:

F(0, s(0), s(y')) -> F(s(y'), s(plus(s(y'), y')), s(y'))
F(0, s(0), 0) -> F(0, 0, 0)

The transformation is resulting in no new DP problems.


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