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
         ↳Size-Change Principle
       →DP Problem 2
         ↳SCP


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))





We number the DPs as follows:
  1. +'(+(x, y), z) -> +'(y, z)
  2. +'(+(x, y), z) -> +'(x, +(y, z))
and get the following Size-Change Graph(s):
{2, 1} , {2, 1}
1>1
2=2
{2, 1} , {2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{2, 1} , {2, 1}
1>1
2=2
{2, 1} , {2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial


We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳Size-Change Principle


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))





We number the DPs as follows:
  1. *'(+(x, y), z) -> *'(y, z)
  2. *'(+(x, y), z) -> *'(x, z)
  3. *'(x, +(y, z)) -> *'(x, z)
  4. *'(x, +(y, z)) -> *'(x, y)
and get the following Size-Change Graph(s):
{4, 3, 2, 1} , {4, 3, 2, 1}
1>1
2=2
{4, 3, 2, 1} , {4, 3, 2, 1}
1=1
2>2

which lead(s) to this/these maximal multigraph(s):
{4, 3, 2, 1} , {4, 3, 2, 1}
1=1
2>2
{4, 3, 2, 1} , {4, 3, 2, 1}
1>1
2=2
{4, 3, 2, 1} , {4, 3, 2, 1}
1>1
2>2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
+(x1, x2) -> +(x1, x2)

We obtain no new DP problems.

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