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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(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'(U11'(tt', N)) → mark'(N)
active'(U21'(tt', M, N)) → mark'(s'(plus'(N, M)))
active'(U31'(tt')) → mark'(0')
active'(U41'(tt', M, N)) → mark'(plus'(x'(N, M), N))
active'(and'(tt', X)) → mark'(X)
active'(isNat'(0')) → mark'(tt')
active'(isNat'(plus'(V1, V2))) → mark'(and'(isNat'(V1), isNat'(V2)))
active'(isNat'(s'(V1))) → mark'(isNat'(V1))
active'(isNat'(x'(V1, V2))) → mark'(and'(isNat'(V1), isNat'(V2)))
active'(plus'(N, 0')) → mark'(U11'(isNat'(N), N))
active'(plus'(N, s'(M))) → mark'(U21'(and'(isNat'(M), isNat'(N)), M, N))
active'(x'(N, 0')) → mark'(U31'(isNat'(N)))
active'(x'(N, s'(M))) → mark'(U41'(and'(isNat'(M), isNat'(N)), M, N))
active'(U11'(X1, X2)) → U11'(active'(X1), X2)
active'(U21'(X1, X2, X3)) → U21'(active'(X1), X2, X3)
active'(s'(X)) → s'(active'(X))
active'(plus'(X1, X2)) → plus'(active'(X1), X2)
active'(plus'(X1, X2)) → plus'(X1, active'(X2))
active'(U31'(X)) → U31'(active'(X))
active'(U41'(X1, X2, X3)) → U41'(active'(X1), X2, X3)
active'(x'(X1, X2)) → x'(active'(X1), X2)
active'(x'(X1, X2)) → x'(X1, active'(X2))
active'(and'(X1, X2)) → and'(active'(X1), X2)
U11'(mark'(X1), X2) → mark'(U11'(X1, X2))
U21'(mark'(X1), X2, X3) → mark'(U21'(X1, X2, X3))
s'(mark'(X)) → mark'(s'(X))
plus'(mark'(X1), X2) → mark'(plus'(X1, X2))
plus'(X1, mark'(X2)) → mark'(plus'(X1, X2))
U31'(mark'(X)) → mark'(U31'(X))
U41'(mark'(X1), X2, X3) → mark'(U41'(X1, X2, X3))
x'(mark'(X1), X2) → mark'(x'(X1, X2))
x'(X1, mark'(X2)) → mark'(x'(X1, X2))
and'(mark'(X1), X2) → mark'(and'(X1, X2))
proper'(U11'(X1, X2)) → U11'(proper'(X1), proper'(X2))
proper'(tt') → ok'(tt')
proper'(U21'(X1, X2, X3)) → U21'(proper'(X1), proper'(X2), proper'(X3))
proper'(s'(X)) → s'(proper'(X))
proper'(plus'(X1, X2)) → plus'(proper'(X1), proper'(X2))
proper'(U31'(X)) → U31'(proper'(X))
proper'(0') → ok'(0')
proper'(U41'(X1, X2, X3)) → U41'(proper'(X1), proper'(X2), proper'(X3))
proper'(x'(X1, X2)) → x'(proper'(X1), proper'(X2))
proper'(and'(X1, X2)) → and'(proper'(X1), proper'(X2))
proper'(isNat'(X)) → isNat'(proper'(X))
U11'(ok'(X1), ok'(X2)) → ok'(U11'(X1, X2))
U21'(ok'(X1), ok'(X2), ok'(X3)) → ok'(U21'(X1, X2, X3))
s'(ok'(X)) → ok'(s'(X))
plus'(ok'(X1), ok'(X2)) → ok'(plus'(X1, X2))
U31'(ok'(X)) → ok'(U31'(X))
U41'(ok'(X1), ok'(X2), ok'(X3)) → ok'(U41'(X1, X2, X3))
x'(ok'(X1), ok'(X2)) → ok'(x'(X1, X2))
and'(ok'(X1), ok'(X2)) → ok'(and'(X1, X2))
isNat'(ok'(X)) → ok'(isNat'(X))
top'(mark'(X)) → top'(proper'(X))
top'(ok'(X)) → top'(active'(X))

Rewrite Strategy: INNERMOST

Infered types.

Rules:
active'(U11'(tt', N)) → mark'(N)
active'(U21'(tt', M, N)) → mark'(s'(plus'(N, M)))
active'(U31'(tt')) → mark'(0')
active'(U41'(tt', M, N)) → mark'(plus'(x'(N, M), N))
active'(and'(tt', X)) → mark'(X)
active'(isNat'(0')) → mark'(tt')
active'(isNat'(plus'(V1, V2))) → mark'(and'(isNat'(V1), isNat'(V2)))
active'(isNat'(s'(V1))) → mark'(isNat'(V1))
active'(isNat'(x'(V1, V2))) → mark'(and'(isNat'(V1), isNat'(V2)))
active'(plus'(N, 0')) → mark'(U11'(isNat'(N), N))
active'(plus'(N, s'(M))) → mark'(U21'(and'(isNat'(M), isNat'(N)), M, N))
active'(x'(N, 0')) → mark'(U31'(isNat'(N)))
active'(x'(N, s'(M))) → mark'(U41'(and'(isNat'(M), isNat'(N)), M, N))
active'(U11'(X1, X2)) → U11'(active'(X1), X2)
active'(U21'(X1, X2, X3)) → U21'(active'(X1), X2, X3)
active'(s'(X)) → s'(active'(X))
active'(plus'(X1, X2)) → plus'(active'(X1), X2)
active'(plus'(X1, X2)) → plus'(X1, active'(X2))
active'(U31'(X)) → U31'(active'(X))
active'(U41'(X1, X2, X3)) → U41'(active'(X1), X2, X3)
active'(x'(X1, X2)) → x'(active'(X1), X2)
active'(x'(X1, X2)) → x'(X1, active'(X2))
active'(and'(X1, X2)) → and'(active'(X1), X2)
U11'(mark'(X1), X2) → mark'(U11'(X1, X2))
U21'(mark'(X1), X2, X3) → mark'(U21'(X1, X2, X3))
s'(mark'(X)) → mark'(s'(X))
plus'(mark'(X1), X2) → mark'(plus'(X1, X2))
plus'(X1, mark'(X2)) → mark'(plus'(X1, X2))
U31'(mark'(X)) → mark'(U31'(X))
U41'(mark'(X1), X2, X3) → mark'(U41'(X1, X2, X3))
x'(mark'(X1), X2) → mark'(x'(X1, X2))
x'(X1, mark'(X2)) → mark'(x'(X1, X2))
and'(mark'(X1), X2) → mark'(and'(X1, X2))
proper'(U11'(X1, X2)) → U11'(proper'(X1), proper'(X2))
proper'(tt') → ok'(tt')
proper'(U21'(X1, X2, X3)) → U21'(proper'(X1), proper'(X2), proper'(X3))
proper'(s'(X)) → s'(proper'(X))
proper'(plus'(X1, X2)) → plus'(proper'(X1), proper'(X2))
proper'(U31'(X)) → U31'(proper'(X))
proper'(0') → ok'(0')
proper'(U41'(X1, X2, X3)) → U41'(proper'(X1), proper'(X2), proper'(X3))
proper'(x'(X1, X2)) → x'(proper'(X1), proper'(X2))
proper'(and'(X1, X2)) → and'(proper'(X1), proper'(X2))
proper'(isNat'(X)) → isNat'(proper'(X))
U11'(ok'(X1), ok'(X2)) → ok'(U11'(X1, X2))
U21'(ok'(X1), ok'(X2), ok'(X3)) → ok'(U21'(X1, X2, X3))
s'(ok'(X)) → ok'(s'(X))
plus'(ok'(X1), ok'(X2)) → ok'(plus'(X1, X2))
U31'(ok'(X)) → ok'(U31'(X))
U41'(ok'(X1), ok'(X2), ok'(X3)) → ok'(U41'(X1, X2, X3))
x'(ok'(X1), ok'(X2)) → ok'(x'(X1, X2))
and'(ok'(X1), ok'(X2)) → ok'(and'(X1, X2))
isNat'(ok'(X)) → ok'(isNat'(X))
top'(mark'(X)) → top'(proper'(X))
top'(ok'(X)) → top'(active'(X))

Types:
active' :: tt':mark':0':ok' → tt':mark':0':ok'
U11' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
tt' :: tt':mark':0':ok'
mark' :: tt':mark':0':ok' → tt':mark':0':ok'
U21' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
s' :: tt':mark':0':ok' → tt':mark':0':ok'
plus' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
U31' :: tt':mark':0':ok' → tt':mark':0':ok'
0' :: tt':mark':0':ok'
U41' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
x' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
and' :: tt':mark':0':ok' → tt':mark':0':ok' → tt':mark':0':ok'
isNat' :: tt':mark':0':ok' → tt':mark':0':ok'
proper' :: tt':mark':0':ok' → tt':mark':0':ok'
ok' :: tt':mark':0':ok' → tt':mark':0':ok'
top' :: tt':mark':0':ok' → top'
_hole_tt':mark':0':ok'1 :: tt':mark':0':ok'
_hole_top'2 :: top'
_gen_tt':mark':0':ok'3 :: Nat → tt':mark':0':ok'

Heuristically decided to analyse the following defined symbols:
active', s', plus', x', and', isNat', U11', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
s' < active'
plus' < active'
x' < active'
and' < active'
isNat' < active'
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
s' < proper'
plus' < proper'
x' < proper'
and' < proper'
isNat' < proper'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
s', active', plus', x', and', isNat', U11', U21', U31', U41', proper', top'

Proved the following rewrite lemma:
s'(_gen_tt':mark':0':ok'3(+(1, _n5))) → _*4, rt ∈ Ω(_n5)

Induction Base:
s'(_gen_tt':mark':0':ok'3(+(1, 0)))

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

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

Lemmas:
s'(_gen_tt':mark':0':ok'3(+(1, _n5))) → _*4, rt ∈ Ω(_n5)

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
plus', active', x', and', isNat', U11', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
plus' < active'
x' < active'
and' < active'
isNat' < active'
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
plus' < proper'
x' < proper'
and' < proper'
isNat' < proper'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

Proved the following rewrite lemma:
plus'(_gen_tt':mark':0':ok'3(+(1, _n2038)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n2038)

Induction Base:
plus'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b))

Induction Step:
plus'(_gen_tt':mark':0':ok'3(+(1, +(_$n2039, 1))), _gen_tt':mark':0':ok'3(_b3075)) →_R^Ω(1)
mark'(plus'(_gen_tt':mark':0':ok'3(+(1, _$n2039)), _gen_tt':mark':0':ok'3(_b3075))) →_IH
mark'(_*4)

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

Lemmas:
s'(_gen_tt':mark':0':ok'3(+(1, _n5))) → _*4, rt ∈ Ω(_n5)
plus'(_gen_tt':mark':0':ok'3(+(1, _n2038)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n2038)

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
x', active', and', isNat', U11', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
x' < active'
and' < active'
isNat' < active'
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
x' < proper'
and' < proper'
isNat' < proper'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

Proved the following rewrite lemma:
x'(_gen_tt':mark':0':ok'3(+(1, _n5723)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n5723)

Induction Base:
x'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b))

Induction Step:
x'(_gen_tt':mark':0':ok'3(+(1, +(_$n5724, 1))), _gen_tt':mark':0':ok'3(_b7084)) →_R^Ω(1)
mark'(x'(_gen_tt':mark':0':ok'3(+(1, _$n5724)), _gen_tt':mark':0':ok'3(_b7084))) →_IH
mark'(_*4)

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
and', active', isNat', U11', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
and' < active'
isNat' < active'
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
and' < proper'
isNat' < proper'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

Proved the following rewrite lemma:
and'(_gen_tt':mark':0':ok'3(+(1, _n9776)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n9776)

Induction Base:
and'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b))

Induction Step:
and'(_gen_tt':mark':0':ok'3(+(1, +(_$n9777, 1))), _gen_tt':mark':0':ok'3(_b11245)) →_R^Ω(1)
mark'(and'(_gen_tt':mark':0':ok'3(+(1, _$n9777)), _gen_tt':mark':0':ok'3(_b11245))) →_IH
mark'(_*4)

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
isNat', active', U11', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
isNat' < active'
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
isNat' < proper'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

The following defined symbols remain to be analysed:
U11', active', U21', U31', U41', proper', top'

They will be analysed ascendingly in the following order:
U11' < active'
U21' < active'
U31' < active'
U41' < active'
active' < top'
U11' < proper'
U21' < proper'
U31' < proper'
U41' < proper'
proper' < top'

Proved the following rewrite lemma:
U11'(_gen_tt':mark':0':ok'3(+(1, _n14020)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n14020)

Induction Base:
U11'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b))

Induction Step:
U11'(_gen_tt':mark':0':ok'3(+(1, +(_$n14021, 1))), _gen_tt':mark':0':ok'3(_b15813)) →_R^Ω(1)
mark'(U11'(_gen_tt':mark':0':ok'3(+(1, _$n14021)), _gen_tt':mark':0':ok'3(_b15813))) →_IH
mark'(_*4)

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

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

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

Proved the following rewrite lemma:
U21'(_gen_tt':mark':0':ok'3(+(1, _n18590)), _gen_tt':mark':0':ok'3(b), _gen_tt':mark':0':ok'3(c)) → _*4, rt ∈ Ω(_n18590)

Induction Base:
U21'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b), _gen_tt':mark':0':ok'3(c))

Induction Step:
U21'(_gen_tt':mark':0':ok'3(+(1, +(_$n18591, 1))), _gen_tt':mark':0':ok'3(_b21871), _gen_tt':mark':0':ok'3(_c21872)) →_R^Ω(1)
mark'(U21'(_gen_tt':mark':0':ok'3(+(1, _$n18591)), _gen_tt':mark':0':ok'3(_b21871), _gen_tt':mark':0':ok'3(_c21872))) →_IH
mark'(_*4)

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

Lemmas:
s'(_gen_tt':mark':0':ok'3(+(1, _n5))) → _*4, rt ∈ Ω(_n5)
plus'(_gen_tt':mark':0':ok'3(+(1, _n2038)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n2038)
x'(_gen_tt':mark':0':ok'3(+(1, _n5723)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n5723)
and'(_gen_tt':mark':0':ok'3(+(1, _n9776)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n9776)
U11'(_gen_tt':mark':0':ok'3(+(1, _n14020)), _gen_tt':mark':0':ok'3(b)) → _*4, rt ∈ Ω(_n14020)
U21'(_gen_tt':mark':0':ok'3(+(1, _n18590)), _gen_tt':mark':0':ok'3(b), _gen_tt':mark':0':ok'3(c)) → _*4, rt ∈ Ω(_n18590)

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

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

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

Proved the following rewrite lemma:
U31'(_gen_tt':mark':0':ok'3(+(1, _n25659))) → _*4, rt ∈ Ω(_n25659)

Induction Base:
U31'(_gen_tt':mark':0':ok'3(+(1, 0)))

Induction Step:
U31'(_gen_tt':mark':0':ok'3(+(1, +(_$n25660, 1)))) →_R^Ω(1)
mark'(U31'(_gen_tt':mark':0':ok'3(+(1, _$n25660)))) →_IH
mark'(_*4)

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

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

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

Proved the following rewrite lemma:
U41'(_gen_tt':mark':0':ok'3(+(1, _n28838)), _gen_tt':mark':0':ok'3(b), _gen_tt':mark':0':ok'3(c)) → _*4, rt ∈ Ω(_n28838)

Induction Base:
U41'(_gen_tt':mark':0':ok'3(+(1, 0)), _gen_tt':mark':0':ok'3(b), _gen_tt':mark':0':ok'3(c))

Induction Step:
U41'(_gen_tt':mark':0':ok'3(+(1, +(_$n28839, 1))), _gen_tt':mark':0':ok'3(_b33091), _gen_tt':mark':0':ok'3(_c33092)) →_R^Ω(1)
mark'(U41'(_gen_tt':mark':0':ok'3(+(1, _$n28839)), _gen_tt':mark':0':ok'3(_b33091), _gen_tt':mark':0':ok'3(_c33092))) →_IH
mark'(_*4)

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

Generator Equations:
_gen_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':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_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':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_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':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_tt':mark':0':ok'3(0) ⇔ tt'
_gen_tt':mark':0':ok'3(+(x, 1)) ⇔ mark'(_gen_tt':mark':0':ok'3(x))

No more defined symbols left to analyse.

The lowerbound Ω(n) was proven with the following lemma:
s'(_gen_tt':mark':0':ok'3(+(1, _n5))) → _*4, rt ∈ Ω(_n5)