(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
sum(0) → 0
sum(s(x)) → +(sqr(s(x)), sum(x))
sqr(x) → *(x, x)
sum(s(x)) → +(*(s(x), s(x)), sum(x))
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Precedence:
sum1 > 0 > *2
sum1 > +2 > *2
sum1 > sqr1 > *2
s1 > +2 > *2
s1 > sqr1 > *2
Status:
sqr1: [1]
*2: [1,2]
sum1: [1]
s1: [1]
0: []
+2: [1,2]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
sum(0) → 0
sum(s(x)) → +(sqr(s(x)), sum(x))
sqr(x) → *(x, x)
sum(s(x)) → +(*(s(x), s(x)), sum(x))
(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