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

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Argument Filtering and Ordering`

Dependency Pairs:

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

Rules:

*(x, *(y, z)) -> *(otimes(x, y), z)
*(1, y) -> y
*(+(x, y), z) -> oplus(*(x, z), *(y, z))
*(x, oplus(y, z)) -> oplus(*(x, y), *(x, z))

The following dependency pairs can be strictly oriented:

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

The following rules can be oriented:

*(x, *(y, z)) -> *(otimes(x, y), z)
*(1, y) -> y
*(+(x, y), z) -> oplus(*(x, z), *(y, z))
*(x, oplus(y, z)) -> oplus(*(x, y), *(x, z))

Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
*'(x1, x2) -> x1
otimes(x1, x2) -> x1
+(x1, x2) -> +(x1, x2)
*(x1, x2) -> *(x1, x2)
oplus(x1, x2) -> x1

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

The following remains to be proven:
Dependency Pairs:

*'(x, oplus(y, z)) -> *'(x, z)
*'(x, oplus(y, z)) -> *'(x, y)
*'(x, *(y, z)) -> *'(otimes(x, y), z)

Rules:

*(x, *(y, z)) -> *(otimes(x, y), z)
*(1, y) -> y
*(+(x, y), z) -> oplus(*(x, z), *(y, z))
*(x, oplus(y, z)) -> oplus(*(x, y), *(x, z))

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