(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
p(m, n, s(r)) → p(m, r, n)
p(m, s(n), 0) → p(0, n, m)
p(m, 0, 0) → m
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(0) = 0
POL(p(x1, x2, x3)) = 1 + x1 + x2 + x3
POL(s(x1)) = x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
p(m, 0, 0) → m
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
p(m, n, s(r)) → p(m, r, n)
p(m, s(n), 0) → p(0, n, m)
Q is empty.
(3) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(0) = 0
POL(p(x1, x2, x3)) = x1 + x2 + x3
POL(s(x1)) = 1 + x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
p(m, n, s(r)) → p(m, r, n)
p(m, s(n), 0) → p(0, n, m)
(4) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(5) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(6) TRUE
(7) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(8) TRUE