(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(0, x) → x
plus(x, s(y)) → s(plus(x, y))
plus(s(x), y) → s(plus(x, y))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Precedence:
times2 > 0 > s1
times2 > plus2 > s1

Status:
times2: [1,2]
0: []
s1: [1]
plus2: [1,2]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(0, x) → x
plus(x, s(y)) → s(plus(x, y))
plus(s(x), y) → s(plus(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