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

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Argument Filtering and Ordering`

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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:
+' > s

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

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳AFS`
`           →DP Problem 2`
`             ↳Dependency Graph`

Dependency Pair:

Rules:

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

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