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

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains two SCCs. 


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


Dependency Pairs:

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


Rules:


+(x, 0) -> x
+(x, i(x)) -> 0
+(+(x, y), z) -> +(x, +(y, z))
*(x, +(y, z)) -> +(*(x, y), *(x, z))
*(+(x, y), z) -> +(*(x, z), *(y, z))





The following dependency pairs can be strictly oriented:

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


The following usable rules using the Ce-refinement can be oriented:

+(x, 0) -> x
+(x, i(x)) -> 0
+(+(x, y), z) -> +(x, +(y, z))


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
i > 0
+' > +

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


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


Dependency Pair:


Rules:


+(x, 0) -> x
+(x, i(x)) -> 0
+(+(x, y), z) -> +(x, +(y, z))
*(x, +(y, z)) -> +(*(x, y), *(x, z))
*(+(x, y), z) -> +(*(x, z), *(y, z))





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, y), z) -> *'(y, z)
*'(+(x, y), z) -> *'(x, z)
*'(x, +(y, z)) -> *'(x, z)
*'(x, +(y, z)) -> *'(x, y)


Rules:


+(x, 0) -> x
+(x, i(x)) -> 0
+(+(x, y), z) -> +(x, +(y, z))
*(x, +(y, z)) -> +(*(x, y), *(x, z))
*(+(x, y), z) -> +(*(x, z), *(y, z))





The following dependency pairs can be strictly oriented:

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


There are no usable rules using the Ce-refinement 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)


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


Dependency Pair:


Rules:


+(x, 0) -> x
+(x, i(x)) -> 0
+(+(x, y), z) -> +(x, +(y, z))
*(x, +(y, z)) -> +(*(x, y), *(x, z))
*(+(x, y), z) -> +(*(x, z), *(y, z))





Using the Dependency Graph resulted in no new DP problems.

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