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