Runtime Complexity TRS:
The TRS R consists of the following rules:

active(terms(N)) → mark(cons(recip(sqr(N)), terms(s(N))))
active(sqr(0)) → mark(0)
active(sqr(s(X))) → mark(s(add(sqr(X), dbl(X))))
active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(first(0, X)) → mark(nil)
active(first(s(X), cons(Y, Z))) → mark(cons(Y, first(X, Z)))
active(half(0)) → mark(0)
active(half(s(0))) → mark(0)
active(half(s(s(X)))) → mark(s(half(X)))
active(half(dbl(X))) → mark(X)
active(terms(X)) → terms(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(recip(X)) → recip(active(X))
active(sqr(X)) → sqr(active(X))
active(s(X)) → s(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(dbl(X)) → dbl(active(X))
active(first(X1, X2)) → first(active(X1), X2)
active(first(X1, X2)) → first(X1, active(X2))
active(half(X)) → half(active(X))
terms(mark(X)) → mark(terms(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
recip(mark(X)) → mark(recip(X))
sqr(mark(X)) → mark(sqr(X))
s(mark(X)) → mark(s(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
dbl(mark(X)) → mark(dbl(X))
first(mark(X1), X2) → mark(first(X1, X2))
first(X1, mark(X2)) → mark(first(X1, X2))
half(mark(X)) → mark(half(X))
proper(terms(X)) → terms(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(recip(X)) → recip(proper(X))
proper(sqr(X)) → sqr(proper(X))
proper(s(X)) → s(proper(X))
proper(0) → ok(0)
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(dbl(X)) → dbl(proper(X))
proper(first(X1, X2)) → first(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(half(X)) → half(proper(X))
terms(ok(X)) → ok(terms(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
recip(ok(X)) → ok(recip(X))
sqr(ok(X)) → ok(sqr(X))
s(ok(X)) → ok(s(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
dbl(ok(X)) → ok(dbl(X))
first(ok(X1), ok(X2)) → ok(first(X1, X2))
half(ok(X)) → ok(half(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

Runtime Complexity TRS:
The TRS R consists of the following rules:

active'(terms'(N)) → mark'(cons'(recip'(sqr'(N)), terms'(s'(N))))
active'(sqr'(0')) → mark'(0')
active'(sqr'(s'(X))) → mark'(s'(add'(sqr'(X), dbl'(X))))
active'(dbl'(0')) → mark'(0')
active'(dbl'(s'(X))) → mark'(s'(s'(dbl'(X))))
active'(add'(0', X)) → mark'(X)
active'(add'(s'(X), Y)) → mark'(s'(add'(X, Y)))
active'(first'(0', X)) → mark'(nil')
active'(first'(s'(X), cons'(Y, Z))) → mark'(cons'(Y, first'(X, Z)))
active'(half'(0')) → mark'(0')
active'(half'(s'(0'))) → mark'(0')
active'(half'(s'(s'(X)))) → mark'(s'(half'(X)))
active'(half'(dbl'(X))) → mark'(X)
active'(terms'(X)) → terms'(active'(X))
active'(cons'(X1, X2)) → cons'(active'(X1), X2)
active'(recip'(X)) → recip'(active'(X))
active'(sqr'(X)) → sqr'(active'(X))
active'(s'(X)) → s'(active'(X))
active'(add'(X1, X2)) → add'(active'(X1), X2)
active'(add'(X1, X2)) → add'(X1, active'(X2))
active'(dbl'(X)) → dbl'(active'(X))
active'(first'(X1, X2)) → first'(active'(X1), X2)
active'(first'(X1, X2)) → first'(X1, active'(X2))
active'(half'(X)) → half'(active'(X))
terms'(mark'(X)) → mark'(terms'(X))
cons'(mark'(X1), X2) → mark'(cons'(X1, X2))
recip'(mark'(X)) → mark'(recip'(X))
sqr'(mark'(X)) → mark'(sqr'(X))
s'(mark'(X)) → mark'(s'(X))
add'(mark'(X1), X2) → mark'(add'(X1, X2))
add'(X1, mark'(X2)) → mark'(add'(X1, X2))
dbl'(mark'(X)) → mark'(dbl'(X))
first'(mark'(X1), X2) → mark'(first'(X1, X2))
first'(X1, mark'(X2)) → mark'(first'(X1, X2))
half'(mark'(X)) → mark'(half'(X))
proper'(terms'(X)) → terms'(proper'(X))
proper'(cons'(X1, X2)) → cons'(proper'(X1), proper'(X2))
proper'(recip'(X)) → recip'(proper'(X))
proper'(sqr'(X)) → sqr'(proper'(X))
proper'(s'(X)) → s'(proper'(X))
proper'(0') → ok'(0')
proper'(add'(X1, X2)) → add'(proper'(X1), proper'(X2))
proper'(dbl'(X)) → dbl'(proper'(X))
proper'(first'(X1, X2)) → first'(proper'(X1), proper'(X2))
proper'(nil') → ok'(nil')
proper'(half'(X)) → half'(proper'(X))
terms'(ok'(X)) → ok'(terms'(X))
cons'(ok'(X1), ok'(X2)) → ok'(cons'(X1, X2))
recip'(ok'(X)) → ok'(recip'(X))
sqr'(ok'(X)) → ok'(sqr'(X))
s'(ok'(X)) → ok'(s'(X))
add'(ok'(X1), ok'(X2)) → ok'(add'(X1, X2))
dbl'(ok'(X)) → ok'(dbl'(X))
first'(ok'(X1), ok'(X2)) → ok'(first'(X1, X2))
half'(ok'(X)) → ok'(half'(X))
top'(mark'(X)) → top'(proper'(X))
top'(ok'(X)) → top'(active'(X))

Rewrite Strategy: INNERMOST

Infered types.

Rules:
active'(terms'(N)) → mark'(cons'(recip'(sqr'(N)), terms'(s'(N))))
active'(sqr'(0')) → mark'(0')
active'(sqr'(s'(X))) → mark'(s'(add'(sqr'(X), dbl'(X))))
active'(dbl'(0')) → mark'(0')
active'(dbl'(s'(X))) → mark'(s'(s'(dbl'(X))))
active'(add'(0', X)) → mark'(X)
active'(add'(s'(X), Y)) → mark'(s'(add'(X, Y)))
active'(first'(0', X)) → mark'(nil')
active'(first'(s'(X), cons'(Y, Z))) → mark'(cons'(Y, first'(X, Z)))
active'(half'(0')) → mark'(0')
active'(half'(s'(0'))) → mark'(0')
active'(half'(s'(s'(X)))) → mark'(s'(half'(X)))
active'(half'(dbl'(X))) → mark'(X)
active'(terms'(X)) → terms'(active'(X))
active'(cons'(X1, X2)) → cons'(active'(X1), X2)
active'(recip'(X)) → recip'(active'(X))
active'(sqr'(X)) → sqr'(active'(X))
active'(s'(X)) → s'(active'(X))
active'(add'(X1, X2)) → add'(active'(X1), X2)
active'(add'(X1, X2)) → add'(X1, active'(X2))
active'(dbl'(X)) → dbl'(active'(X))
active'(first'(X1, X2)) → first'(active'(X1), X2)
active'(first'(X1, X2)) → first'(X1, active'(X2))
active'(half'(X)) → half'(active'(X))
terms'(mark'(X)) → mark'(terms'(X))
cons'(mark'(X1), X2) → mark'(cons'(X1, X2))
recip'(mark'(X)) → mark'(recip'(X))
sqr'(mark'(X)) → mark'(sqr'(X))
s'(mark'(X)) → mark'(s'(X))
add'(mark'(X1), X2) → mark'(add'(X1, X2))
add'(X1, mark'(X2)) → mark'(add'(X1, X2))
dbl'(mark'(X)) → mark'(dbl'(X))
first'(mark'(X1), X2) → mark'(first'(X1, X2))
first'(X1, mark'(X2)) → mark'(first'(X1, X2))
half'(mark'(X)) → mark'(half'(X))
proper'(terms'(X)) → terms'(proper'(X))
proper'(cons'(X1, X2)) → cons'(proper'(X1), proper'(X2))
proper'(recip'(X)) → recip'(proper'(X))
proper'(sqr'(X)) → sqr'(proper'(X))
proper'(s'(X)) → s'(proper'(X))
proper'(0') → ok'(0')
proper'(add'(X1, X2)) → add'(proper'(X1), proper'(X2))
proper'(dbl'(X)) → dbl'(proper'(X))
proper'(first'(X1, X2)) → first'(proper'(X1), proper'(X2))
proper'(nil') → ok'(nil')
proper'(half'(X)) → half'(proper'(X))
terms'(ok'(X)) → ok'(terms'(X))
cons'(ok'(X1), ok'(X2)) → ok'(cons'(X1, X2))
recip'(ok'(X)) → ok'(recip'(X))
sqr'(ok'(X)) → ok'(sqr'(X))
s'(ok'(X)) → ok'(s'(X))
add'(ok'(X1), ok'(X2)) → ok'(add'(X1, X2))
dbl'(ok'(X)) → ok'(dbl'(X))
first'(ok'(X1), ok'(X2)) → ok'(first'(X1, X2))
half'(ok'(X)) → ok'(half'(X))
top'(mark'(X)) → top'(proper'(X))
top'(ok'(X)) → top'(active'(X))

Types:
active' :: mark':0':nil':ok' → mark':0':nil':ok'
terms' :: mark':0':nil':ok' → mark':0':nil':ok'
mark' :: mark':0':nil':ok' → mark':0':nil':ok'
cons' :: mark':0':nil':ok' → mark':0':nil':ok' → mark':0':nil':ok'
recip' :: mark':0':nil':ok' → mark':0':nil':ok'
sqr' :: mark':0':nil':ok' → mark':0':nil':ok'
s' :: mark':0':nil':ok' → mark':0':nil':ok'
0' :: mark':0':nil':ok'
add' :: mark':0':nil':ok' → mark':0':nil':ok' → mark':0':nil':ok'
dbl' :: mark':0':nil':ok' → mark':0':nil':ok'
first' :: mark':0':nil':ok' → mark':0':nil':ok' → mark':0':nil':ok'
nil' :: mark':0':nil':ok'
half' :: mark':0':nil':ok' → mark':0':nil':ok'
proper' :: mark':0':nil':ok' → mark':0':nil':ok'
ok' :: mark':0':nil':ok' → mark':0':nil':ok'
top' :: mark':0':nil':ok' → top'
_hole_mark':0':nil':ok'1 :: mark':0':nil':ok'
_hole_top'2 :: top'
_gen_mark':0':nil':ok'3 :: Nat → mark':0':nil':ok'

Heuristically decided to analyse the following defined symbols:
active', cons', recip', sqr', terms', s', add', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
cons' < active'
recip' < active'
sqr' < active'
terms' < active'
s' < active'
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
cons' < proper'
recip' < proper'
sqr' < proper'
terms' < proper'
s' < proper'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
cons', active', recip', sqr', terms', s', add', dbl', first', half', proper', top'

Proved the following rewrite lemma:
cons'(_gen_mark':0':nil':ok'3(+(1, _n5)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n5)

Induction Base:
cons'(_gen_mark':0':nil':ok'3(+(1, 0)), _gen_mark':0':nil':ok'3(b))

Induction Step:
cons'(_gen_mark':0':nil':ok'3(+(1, +(_$n6, 1))), _gen_mark':0':nil':ok'3(_b610)) →_R^Ω(1)
mark'(cons'(_gen_mark':0':nil':ok'3(+(1, _$n6)), _gen_mark':0':nil':ok'3(_b610))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Lemmas:
cons'(_gen_mark':0':nil':ok'3(+(1, _n5)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n5)

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
recip', active', sqr', terms', s', add', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
recip' < active'
sqr' < active'
terms' < active'
s' < active'
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
recip' < proper'
sqr' < proper'
terms' < proper'
s' < proper'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
recip'(_gen_mark':0':nil':ok'3(+(1, _n2771))) → _*4, rt ∈ Ω(_n2771)

Induction Base:
recip'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
recip'(_gen_mark':0':nil':ok'3(+(1, +(_$n2772, 1)))) →_R^Ω(1)
mark'(recip'(_gen_mark':0':nil':ok'3(+(1, _$n2772)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Lemmas:
cons'(_gen_mark':0':nil':ok'3(+(1, _n5)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n5)
recip'(_gen_mark':0':nil':ok'3(+(1, _n2771))) → _*4, rt ∈ Ω(_n2771)

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
sqr', active', terms', s', add', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
sqr' < active'
terms' < active'
s' < active'
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
sqr' < proper'
terms' < proper'
s' < proper'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
sqr'(_gen_mark':0':nil':ok'3(+(1, _n4662))) → _*4, rt ∈ Ω(_n4662)

Induction Base:
sqr'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
sqr'(_gen_mark':0':nil':ok'3(+(1, +(_$n4663, 1)))) →_R^Ω(1)
mark'(sqr'(_gen_mark':0':nil':ok'3(+(1, _$n4663)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
terms', active', s', add', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
terms' < active'
s' < active'
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
terms' < proper'
s' < proper'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
terms'(_gen_mark':0':nil':ok'3(+(1, _n6677))) → _*4, rt ∈ Ω(_n6677)

Induction Base:
terms'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
terms'(_gen_mark':0':nil':ok'3(+(1, +(_$n6678, 1)))) →_R^Ω(1)
mark'(terms'(_gen_mark':0':nil':ok'3(+(1, _$n6678)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
s', active', add', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
s' < active'
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
s' < proper'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
s'(_gen_mark':0':nil':ok'3(+(1, _n8816))) → _*4, rt ∈ Ω(_n8816)

Induction Base:
s'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
s'(_gen_mark':0':nil':ok'3(+(1, +(_$n8817, 1)))) →_R^Ω(1)
mark'(s'(_gen_mark':0':nil':ok'3(+(1, _$n8817)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
add', active', dbl', first', half', proper', top'

They will be analysed ascendingly in the following order:
add' < active'
dbl' < active'
first' < active'
half' < active'
active' < top'
add' < proper'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
add'(_gen_mark':0':nil':ok'3(+(1, _n11079)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n11079)

Induction Base:
add'(_gen_mark':0':nil':ok'3(+(1, 0)), _gen_mark':0':nil':ok'3(b))

Induction Step:
add'(_gen_mark':0':nil':ok'3(+(1, +(_$n11080, 1))), _gen_mark':0':nil':ok'3(_b13088)) →_R^Ω(1)
mark'(add'(_gen_mark':0':nil':ok'3(+(1, _$n11080)), _gen_mark':0':nil':ok'3(_b13088))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
dbl', active', first', half', proper', top'

They will be analysed ascendingly in the following order:
dbl' < active'
first' < active'
half' < active'
active' < top'
dbl' < proper'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
dbl'(_gen_mark':0':nil':ok'3(+(1, _n15396))) → _*4, rt ∈ Ω(_n15396)

Induction Base:
dbl'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
dbl'(_gen_mark':0':nil':ok'3(+(1, +(_$n15397, 1)))) →_R^Ω(1)
mark'(dbl'(_gen_mark':0':nil':ok'3(+(1, _$n15397)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Lemmas:
cons'(_gen_mark':0':nil':ok'3(+(1, _n5)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n5)
recip'(_gen_mark':0':nil':ok'3(+(1, _n2771))) → _*4, rt ∈ Ω(_n2771)
sqr'(_gen_mark':0':nil':ok'3(+(1, _n4662))) → _*4, rt ∈ Ω(_n4662)
terms'(_gen_mark':0':nil':ok'3(+(1, _n6677))) → _*4, rt ∈ Ω(_n6677)
s'(_gen_mark':0':nil':ok'3(+(1, _n8816))) → _*4, rt ∈ Ω(_n8816)
add'(_gen_mark':0':nil':ok'3(+(1, _n11079)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n11079)
dbl'(_gen_mark':0':nil':ok'3(+(1, _n15396))) → _*4, rt ∈ Ω(_n15396)

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
first', active', half', proper', top'

They will be analysed ascendingly in the following order:
first' < active'
half' < active'
active' < top'
first' < proper'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
first'(_gen_mark':0':nil':ok'3(+(1, _n17974)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n17974)

Induction Base:
first'(_gen_mark':0':nil':ok'3(+(1, 0)), _gen_mark':0':nil':ok'3(b))

Induction Step:
first'(_gen_mark':0':nil':ok'3(+(1, +(_$n17975, 1))), _gen_mark':0':nil':ok'3(_b20523)) →_R^Ω(1)
mark'(first'(_gen_mark':0':nil':ok'3(+(1, _$n17975)), _gen_mark':0':nil':ok'3(_b20523))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
half', active', proper', top'

They will be analysed ascendingly in the following order:
half' < active'
active' < top'
half' < proper'
proper' < top'

Proved the following rewrite lemma:
half'(_gen_mark':0':nil':ok'3(+(1, _n22900))) → _*4, rt ∈ Ω(_n22900)

Induction Base:
half'(_gen_mark':0':nil':ok'3(+(1, 0)))

Induction Step:
half'(_gen_mark':0':nil':ok'3(+(1, +(_$n22901, 1)))) →_R^Ω(1)
mark'(half'(_gen_mark':0':nil':ok'3(+(1, _$n22901)))) →_IH
mark'(_*4)

We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
active', proper', top'

They will be analysed ascendingly in the following order:
active' < top'
proper' < top'

Could not prove a rewrite lemma for the defined symbol active'.

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
proper', top'

They will be analysed ascendingly in the following order:
proper' < top'

Could not prove a rewrite lemma for the defined symbol proper'.

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

The following defined symbols remain to be analysed:
top'

Could not prove a rewrite lemma for the defined symbol top'.

Generator Equations:
_gen_mark':0':nil':ok'3(0) ⇔ 0'
_gen_mark':0':nil':ok'3(+(x, 1)) ⇔ mark'(_gen_mark':0':nil':ok'3(x))

No more defined symbols left to analyse.

The lowerbound Ω(n) was proven with the following lemma:
cons'(_gen_mark':0':nil':ok'3(+(1, _n5)), _gen_mark':0':nil':ok'3(b)) → _*4, rt ∈ Ω(_n5)