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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains two SCCs. 


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


Dependency Pair:

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


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
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 3
             ↳Dependency Graph
       →DP Problem 2
         ↳Nar


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Narrowing Transformation


Dependency Pairs:

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


Rules:


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


Strategy:

innermost




On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

*'(*(x, y), z) -> *'(x, *(y, z))
three new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Nar
           →DP Problem 4
             ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

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


Rules:


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


Strategy:

innermost



Innermost Termination of R could not be shown.
Duration:
0:00 minutes