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

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

+'(O(x), O(y)) -> O'(+(x, y))
+'(O(x), O(y)) -> +'(x, y)
+'(O(x), I(y)) -> +'(x, y)
+'(I(x), O(y)) -> +'(x, y)
+'(I(x), I(y)) -> O'(+(+(x, y), I(0)))
+'(I(x), I(y)) -> +'(+(x, y), I(0))
+'(I(x), I(y)) -> +'(x, y)
*'(O(x), y) -> O'(*(x, y))
*'(O(x), y) -> *'(x, y)
*'(I(x), y) -> +'(O(*(x, y)), y)
*'(I(x), y) -> O'(*(x, y))
*'(I(x), y) -> *'(x, y)

Furthermore, R contains two SCCs.


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




The following remains to be proven:


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




The following remains to be proven:

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