Term Rewriting System R:
[x, y]
times(x, plus(y, 1)) -> plus(times(x, plus(y, times(1, 0))), x)
times(x, 1) -> x
times(x, 0) -> 0
plus(x, 0) -> x

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

TIMES(x, plus(y, 1)) -> PLUS(times(x, plus(y, times(1, 0))), x)
TIMES(x, plus(y, 1)) -> TIMES(x, plus(y, times(1, 0)))
TIMES(x, plus(y, 1)) -> PLUS(y, times(1, 0))
TIMES(x, plus(y, 1)) -> TIMES(1, 0)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

TIMES(x, plus(y, 1)) -> TIMES(x, plus(y, times(1, 0)))


Rules:


times(x, plus(y, 1)) -> plus(times(x, plus(y, times(1, 0))), x)
times(x, 1) -> x
times(x, 0) -> 0
plus(x, 0) -> x




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