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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Narrowing Transformation


Dependency Pair:

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


Rules:


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


Strategy:

innermost




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

+'(s(x), s(y)) -> +'(s(x), +(y, 0))
two new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

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


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
+'(x1, x2) -> +'(x1, x2)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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