(0) Obligation:

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

f(x, nil) → g(nil, x)
f(x, g(y, z)) → g(f(x, y), z)
++(x, nil) → x
++(x, g(y, z)) → g(++(x, y), z)
null(nil) → true
null(g(x, y)) → false
mem(nil, y) → false
mem(g(x, y), z) → or(=(y, z), mem(x, z))
mem(x, max(x)) → not(null(x))
max(g(g(nil, x), y)) → max'(x, y)
max(g(g(g(x, y), z), u)) → max'(max(g(g(x, y), z)), u)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive Path Order [RPO].
Precedence:
f2 > nil > g2 > false > null1
f2 > nil > g2 > mem2 > or2 > null1
f2 > nil > g2 > mem2 > =2 > null1
f2 > nil > g2 > mem2 > not1 > null1
f2 > nil > g2 > max'2 > null1
f2 > nil > g2 > u > max1 > not1 > null1
f2 > nil > true > null1
++2 > g2 > false > null1
++2 > g2 > mem2 > or2 > null1
++2 > g2 > mem2 > =2 > null1
++2 > g2 > mem2 > not1 > null1
++2 > g2 > max'2 > null1
++2 > g2 > u > max1 > not1 > null1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

f(x, nil) → g(nil, x)
f(x, g(y, z)) → g(f(x, y), z)
++(x, nil) → x
++(x, g(y, z)) → g(++(x, y), z)
null(nil) → true
null(g(x, y)) → false
mem(nil, y) → false
mem(g(x, y), z) → or(=(y, z), mem(x, z))
mem(x, max(x)) → not(null(x))
max(g(g(nil, x), y)) → max'(x, y)
max(g(g(g(x, y), z), u)) → max'(max(g(g(x, y), z)), u)


(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