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