(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
exp(x, 0) → s(0)
exp(x, s(y)) → *(x, exp(x, y))
*(0, y) → 0
*(s(x), y) → +(y, *(x, y))
-(0, y) → 0
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Precedence:
exp2 > s1 > +2 > -2
exp2 > *2 > 0 > -2
exp2 > *2 > +2 > -2
Status:
exp2: [1,2]
0: []
s1: [1]
*2: [1,2]
+2: [1,2]
-2: [1,2]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
exp(x, 0) → s(0)
exp(x, s(y)) → *(x, exp(x, y))
*(0, y) → 0
*(s(x), y) → +(y, *(x, y))
-(0, y) → 0
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) TRUE