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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

+'(x, s(y)) -> S(+(x, y))
+'(x, s(y)) -> +'(x, y)
S(+(0, y)) -> S(y)

Furthermore, R contains two SCCs. 


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


Dependency Pair:

S(+(0, y)) -> S(y)


Rules:


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


Strategy:

innermost




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

S(+(0, y)) -> S(y)
one new Dependency Pair is created:

S(+(0, +(0, y''))) -> S(+(0, y''))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

S(+(0, +(0, y''))) -> S(+(0, y''))


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

S(+(0, +(0, y''))) -> S(+(0, y''))


The following usable rules for innermost can be oriented:

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


Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
S(x1) -> S(x1)
+(x1, x2) -> +(x1, x2)
s(x1) -> x1


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pair:

+'(x, s(y)) -> +'(x, y)


Rules:


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


Strategy:

innermost




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

+'(x, s(y)) -> +'(x, y)
one new Dependency Pair is created:

+'(x'', s(s(y''))) -> +'(x'', s(y''))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

+'(x'', s(s(y''))) -> +'(x'', s(y''))


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

+'(x'', s(s(y''))) -> +'(x'', s(y''))


The following usable rule for innermost can be oriented:

s(+(0, y)) -> s(y)


Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
+'(x1, x2) -> +'(x1, x2)
s(x1) -> s(x1)
+(x1, x2) -> +(x1, x2)


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
           →DP Problem 5
             ↳AFS
             ...
               →DP Problem 6
                 ↳Dependency Graph


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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