Term Rewriting System R:
[m, n, r]
p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

P(m, n, s(r)) -> P(m, r, n)
P(m, s(n), 0) -> P(0, n, m)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

P(m, s(n), 0) -> P(0, n, m)
P(m, n, s(r)) -> P(m, r, n)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m




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