(0) Obligation:

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

+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
g1 > [+2, h2] > s1 > f1
g1 > 0 > f1

Status:
+2: [2,1]
0: []
s1: [1]
f1: [1]
g1: [1]
h2: [2,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, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))


(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