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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

+'(x, minus(y)) -> MINUS(+(minus(x), y))
+'(x, minus(y)) -> +'(minus(x), y)
+'(x, minus(y)) -> MINUS(x)
+'(x, +(y, z)) -> +'(+(x, y), z)
+'(x, +(y, z)) -> +'(x, y)
+'(minus(+(x, 1)), 1) -> MINUS(x)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pairs:

+'(x, +(y, z)) -> +'(x, y)
+'(x, minus(y)) -> +'(minus(x), y)


Rules:


minus(0) -> 0
minus(minus(x)) -> x
+(x, 0) -> x
+(0, y) -> y
+(minus(1), 1) -> 0
+(x, minus(y)) -> minus(+(minus(x), y))
+(x, +(y, z)) -> +(+(x, y), z)
+(minus(+(x, 1)), 1) -> minus(x)


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


The following usable rules for innermost w.r.t. to the AFS can be oriented:

minus(0) -> 0
minus(minus(x)) -> x


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)
+(x1, x2) -> +(x1, x2)
minus(x1) -> x1


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


Dependency Pair:

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


Rules:


minus(0) -> 0
minus(minus(x)) -> x
+(x, 0) -> x
+(0, y) -> y
+(minus(1), 1) -> 0
+(x, minus(y)) -> minus(+(minus(x), y))
+(x, +(y, z)) -> +(+(x, y), z)
+(minus(+(x, 1)), 1) -> minus(x)


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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