Term Rewriting System R:
[x, y]
*(x, *(minus(y), y)) -> *(minus(*(y, y)), x)
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
*'(x, *(minus(y), y)) -> *'(minus(*(y, y)), x)
*'(x, *(minus(y), y)) -> *'(y, y)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
*'(x, *(minus(y), y)) -> *'(minus(*(y, y)), x)
Rule:
*(x, *(minus(y), y)) -> *(minus(*(y, y)), x)
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes