The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).

(0) Obligation:

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(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))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(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))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: FULL

(1) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)

The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(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))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))

(2) Obligation:

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

top(ok(X)) → top(active(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNat(ok(X)) → ok(isNat(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
proper(tt) → ok(tt)
isNatKind(ok(X)) → ok(isNatKind(X))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X)) → ok(U41(X))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U23(mark(X)) → mark(U23(X))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
s(ok(X)) → ok(s(X))
U23(ok(X)) → ok(U23(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U32(ok(X)) → ok(U32(X))
proper(0) → ok(0)
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
top(mark(X)) → top(proper(X))

Rewrite Strategy: FULL

(3) RcToIrcProof (BOTH BOUNDS(ID, ID) transformation)

Converted rc-obligation to irc-obligation.

As the TRS is a non-duplicating overlay system, we have rc = irc.

(4) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1).


The TRS R consists of the following rules:

top(ok(X)) → top(active(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNat(ok(X)) → ok(isNat(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
proper(tt) → ok(tt)
isNatKind(ok(X)) → ok(isNatKind(X))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X)) → ok(U41(X))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U23(mark(X)) → mark(U23(X))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
s(ok(X)) → ok(s(X))
U23(ok(X)) → ok(U23(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U32(ok(X)) → ok(U32(X))
proper(0) → ok(0)
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
top(mark(X)) → top(proper(X))

Rewrite Strategy: INNERMOST

(5) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24]
transitions:
ok0(0) → 0
active0(0) → 0
mark0(0) → 0
tt0() → 0
00() → 0
top0(0) → 1
U510(0, 0) → 2
U120(0, 0, 0) → 3
isNat0(0) → 4
U220(0, 0) → 5
U640(0, 0, 0) → 6
U520(0, 0) → 7
plus0(0, 0) → 8
U210(0, 0) → 9
proper0(0) → 10
isNatKind0(0) → 11
U110(0, 0, 0) → 12
U320(0) → 13
U410(0) → 14
U310(0, 0) → 15
U630(0, 0, 0) → 16
U150(0, 0) → 17
U610(0, 0, 0) → 18
U130(0, 0, 0) → 19
U230(0) → 20
U140(0, 0, 0) → 21
U160(0) → 22
s0(0) → 23
U620(0, 0, 0) → 24
active1(0) → 25
top1(25) → 1
U511(0, 0) → 26
mark1(26) → 2
U121(0, 0, 0) → 27
ok1(27) → 3
isNat1(0) → 28
ok1(28) → 4
U221(0, 0) → 29
mark1(29) → 5
U121(0, 0, 0) → 30
mark1(30) → 3
U511(0, 0) → 31
ok1(31) → 2
U641(0, 0, 0) → 32
mark1(32) → 6
U521(0, 0) → 33
ok1(33) → 7
U641(0, 0, 0) → 34
ok1(34) → 6
plus1(0, 0) → 35
ok1(35) → 8
plus1(0, 0) → 36
mark1(36) → 8
U211(0, 0) → 37
mark1(37) → 9
U521(0, 0) → 38
mark1(38) → 7
tt1() → 39
ok1(39) → 10
isNatKind1(0) → 40
ok1(40) → 11
U111(0, 0, 0) → 41
mark1(41) → 12
U321(0) → 42
mark1(42) → 13
U411(0) → 43
mark1(43) → 14
U311(0, 0) → 44
ok1(44) → 15
U411(0) → 45
ok1(45) → 14
U631(0, 0, 0) → 46
mark1(46) → 16
U111(0, 0, 0) → 47
ok1(47) → 12
U151(0, 0) → 48
ok1(48) → 17
U611(0, 0, 0) → 49
mark1(49) → 18
U631(0, 0, 0) → 50
ok1(50) → 16
U131(0, 0, 0) → 51
mark1(51) → 19
U231(0) → 52
mark1(52) → 20
U141(0, 0, 0) → 53
ok1(53) → 21
U151(0, 0) → 54
mark1(54) → 17
U161(0) → 55
mark1(55) → 22
U161(0) → 56
ok1(56) → 22
U211(0, 0) → 57
ok1(57) → 9
s1(0) → 58
ok1(58) → 23
U231(0) → 59
ok1(59) → 20
U611(0, 0, 0) → 60
ok1(60) → 18
s1(0) → 61
mark1(61) → 23
U141(0, 0, 0) → 62
mark1(62) → 21
U321(0) → 63
ok1(63) → 13
01() → 64
ok1(64) → 10
U221(0, 0) → 65
ok1(65) → 5
U311(0, 0) → 66
mark1(66) → 15
U131(0, 0, 0) → 67
ok1(67) → 19
U621(0, 0, 0) → 68
ok1(68) → 24
U621(0, 0, 0) → 69
mark1(69) → 24
proper1(0) → 70
top1(70) → 1
mark1(26) → 26
mark1(26) → 31
ok1(27) → 27
ok1(27) → 30
ok1(28) → 28
mark1(29) → 29
mark1(29) → 65
mark1(30) → 27
mark1(30) → 30
ok1(31) → 26
ok1(31) → 31
mark1(32) → 32
mark1(32) → 34
ok1(33) → 33
ok1(33) → 38
ok1(34) → 32
ok1(34) → 34
ok1(35) → 35
ok1(35) → 36
mark1(36) → 35
mark1(36) → 36
mark1(37) → 37
mark1(37) → 57
mark1(38) → 33
mark1(38) → 38
ok1(39) → 70
ok1(40) → 40
mark1(41) → 41
mark1(41) → 47
mark1(42) → 42
mark1(42) → 63
mark1(43) → 43
mark1(43) → 45
ok1(44) → 44
ok1(44) → 66
ok1(45) → 43
ok1(45) → 45
mark1(46) → 46
mark1(46) → 50
ok1(47) → 41
ok1(47) → 47
ok1(48) → 48
ok1(48) → 54
mark1(49) → 49
mark1(49) → 60
ok1(50) → 46
ok1(50) → 50
mark1(51) → 51
mark1(51) → 67
mark1(52) → 52
mark1(52) → 59
ok1(53) → 53
ok1(53) → 62
mark1(54) → 48
mark1(54) → 54
mark1(55) → 55
mark1(55) → 56
ok1(56) → 55
ok1(56) → 56
ok1(57) → 37
ok1(57) → 57
ok1(58) → 58
ok1(58) → 61
ok1(59) → 52
ok1(59) → 59
ok1(60) → 49
ok1(60) → 60
mark1(61) → 58
mark1(61) → 61
mark1(62) → 53
mark1(62) → 62
ok1(63) → 42
ok1(63) → 63
ok1(64) → 70
ok1(65) → 29
ok1(65) → 65
mark1(66) → 44
mark1(66) → 66
ok1(67) → 51
ok1(67) → 67
ok1(68) → 68
ok1(68) → 69
mark1(69) → 68
mark1(69) → 69
active2(39) → 71
top2(71) → 1
active2(64) → 71

(6) BOUNDS(1, n^1)