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