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

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

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Usable Rules (Innermost)


Dependency Pairs:

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


Rules:


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


Strategy:

innermost




As we are in the innermost case, we can delete all 3 non-usable-rules.


   R
DPs
       →DP Problem 1
UsableRules
           →DP Problem 2
Size-Change Principle


Dependency Pairs:

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


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
1>1
2>2
{1, 2} , {1, 2}
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)
+(x1, x2) -> +(x1, x2)

We obtain no new DP problems.

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