Term Rewriting System R:
[x, y, z]
*(i(x), x) -> 1
*(1, y) -> y
*(x, 0) -> 0
*(*(x, y), z) -> *(x, *(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)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
*'(*(x, y), z) -> *'(y, z)
*'(*(x, y), z) -> *'(x, *(y, z))
Rules:
*(i(x), x) -> 1
*(1, y) -> y
*(x, 0) -> 0
*(*(x, y), z) -> *(x, *(y, z))
Termination of R could not be shown.
Duration:
0:00 minutes