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

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains two SCCs.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering
       →DP Problem 2
AFS


Dependency Pairs:

MINUS(+(x, y)) -> MINUS(x)
MINUS(+(x, y)) -> MINUS(y)


Rules:


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





The following dependency pairs can be strictly oriented:

MINUS(+(x, y)) -> MINUS(x)
MINUS(+(x, y)) -> MINUS(y)


There are no usable rules 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:
MINUS(x1) -> MINUS(x1)
+(x1, x2) -> +(x1, x2)


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


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
Argument Filtering and Ordering


Dependency Pairs:

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


Rules:


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





The following dependency pairs can be strictly oriented:

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


There are no usable rules 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)
+(x1, x2) -> +(x1, x2)
minus(x1) -> minus(x1)


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


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.

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