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(U101(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(U11(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(X)
active(U31(tt, N)) → mark(N)
active(U41(tt, N)) → mark(cons(N, natsFrom(s(N))))
active(U51(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U61(tt, Y)) → mark(Y)
active(U71(tt, XS)) → mark(pair(nil, XS))
active(U81(tt, N, X, XS)) → mark(U82(splitAt(N, XS), X))
active(U82(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U91(tt, XS)) → mark(XS)
active(afterNth(N, XS)) → mark(U11(and(isNatural(N), isLNat(XS)), N, XS))
active(and(tt, X)) → mark(X)
active(fst(pair(X, Y))) → mark(U21(and(isLNat(X), isLNat(Y)), X))
active(head(cons(N, XS))) → mark(U31(and(isNatural(N), isLNat(XS)), N))
active(isLNat(nil)) → mark(tt)
active(isLNat(afterNth(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isLNat(cons(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isLNat(fst(V1))) → mark(isPLNat(V1))
active(isLNat(natsFrom(V1))) → mark(isNatural(V1))
active(isLNat(snd(V1))) → mark(isPLNat(V1))
active(isLNat(tail(V1))) → mark(isLNat(V1))
active(isLNat(take(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isNatural(0)) → mark(tt)
active(isNatural(head(V1))) → mark(isLNat(V1))
active(isNatural(s(V1))) → mark(isNatural(V1))
active(isNatural(sel(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isPLNat(pair(V1, V2))) → mark(and(isLNat(V1), isLNat(V2)))
active(isPLNat(splitAt(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(natsFrom(N)) → mark(U41(isNatural(N), N))
active(sel(N, XS)) → mark(U51(and(isNatural(N), isLNat(XS)), N, XS))
active(snd(pair(X, Y))) → mark(U61(and(isLNat(X), isLNat(Y)), Y))
active(splitAt(0, XS)) → mark(U71(isLNat(XS), XS))
active(splitAt(s(N), cons(X, XS))) → mark(U81(and(isNatural(N), and(isNatural(X), isLNat(XS))), N, X, XS))
active(tail(cons(N, XS))) → mark(U91(and(isNatural(N), isLNat(XS)), XS))
active(take(N, XS)) → mark(U101(and(isNatural(N), isLNat(XS)), N, XS))
active(U101(X1, X2, X3)) → U101(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2)) → U41(active(X1), X2)
active(cons(X1, X2)) → cons(active(X1), X2)
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(U51(X1, X2, X3)) → U51(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U61(X1, X2)) → U61(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(U81(X1, X2, X3, X4)) → U81(active(X1), X2, X3, X4)
active(U82(X1, X2)) → U82(active(X1), X2)
active(U91(X1, X2)) → U91(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
U101(mark(X1), X2, X3) → mark(U101(X1, X2, X3))
fst(mark(X)) → mark(fst(X))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
snd(mark(X)) → mark(snd(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2) → mark(U41(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
natsFrom(mark(X)) → mark(natsFrom(X))
s(mark(X)) → mark(s(X))
U51(mark(X1), X2, X3) → mark(U51(X1, X2, X3))
head(mark(X)) → mark(head(X))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U61(mark(X1), X2) → mark(U61(X1, X2))
U71(mark(X1), X2) → mark(U71(X1, X2))
pair(mark(X1), X2) → mark(pair(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
U81(mark(X1), X2, X3, X4) → mark(U81(X1, X2, X3, X4))
U82(mark(X1), X2) → mark(U82(X1, X2))
U91(mark(X1), X2) → mark(U91(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
tail(mark(X)) → mark(tail(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(U101(X1, X2, X3)) → U101(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(fst(X)) → fst(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(U51(X1, X2, X3)) → U51(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U61(X1, X2)) → U61(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(nil) → ok(nil)
proper(U81(X1, X2, X3, X4)) → U81(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U82(X1, X2)) → U82(proper(X1), proper(X2))
proper(U91(X1, X2)) → U91(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNatural(X)) → isNatural(proper(X))
proper(isLNat(X)) → isLNat(proper(X))
proper(isPLNat(X)) → isPLNat(proper(X))
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(0) → ok(0)
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
U101(ok(X1), ok(X2), ok(X3)) → ok(U101(X1, X2, X3))
fst(ok(X)) → ok(fst(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
snd(ok(X)) → ok(snd(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
natsFrom(ok(X)) → ok(natsFrom(X))
s(ok(X)) → ok(s(X))
U51(ok(X1), ok(X2), ok(X3)) → ok(U51(X1, X2, X3))
head(ok(X)) → ok(head(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
U61(ok(X1), ok(X2)) → ok(U61(X1, X2))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
U81(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U81(X1, X2, X3, X4))
U82(ok(X1), ok(X2)) → ok(U82(X1, X2))
U91(ok(X1), ok(X2)) → ok(U91(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNatural(ok(X)) → ok(isNatural(X))
isLNat(ok(X)) → ok(isLNat(X))
isPLNat(ok(X)) → ok(isPLNat(X))
tail(ok(X)) → ok(tail(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(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(U101(tt, N, XS)) → mark(fst(splitAt(N, XS)))
active(U11(tt, N, XS)) → mark(snd(splitAt(N, XS)))
active(U21(tt, X)) → mark(X)
active(U31(tt, N)) → mark(N)
active(U41(tt, N)) → mark(cons(N, natsFrom(s(N))))
active(U51(tt, N, XS)) → mark(head(afterNth(N, XS)))
active(U61(tt, Y)) → mark(Y)
active(U71(tt, XS)) → mark(pair(nil, XS))
active(U81(tt, N, X, XS)) → mark(U82(splitAt(N, XS), X))
active(U82(pair(YS, ZS), X)) → mark(pair(cons(X, YS), ZS))
active(U91(tt, XS)) → mark(XS)
active(afterNth(N, XS)) → mark(U11(and(isNatural(N), isLNat(XS)), N, XS))
active(and(tt, X)) → mark(X)
active(fst(pair(X, Y))) → mark(U21(and(isLNat(X), isLNat(Y)), X))
active(head(cons(N, XS))) → mark(U31(and(isNatural(N), isLNat(XS)), N))
active(isLNat(nil)) → mark(tt)
active(isLNat(afterNth(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isLNat(cons(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isLNat(fst(V1))) → mark(isPLNat(V1))
active(isLNat(natsFrom(V1))) → mark(isNatural(V1))
active(isLNat(snd(V1))) → mark(isPLNat(V1))
active(isLNat(tail(V1))) → mark(isLNat(V1))
active(isLNat(take(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isNatural(0)) → mark(tt)
active(isNatural(head(V1))) → mark(isLNat(V1))
active(isNatural(s(V1))) → mark(isNatural(V1))
active(isNatural(sel(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(isPLNat(pair(V1, V2))) → mark(and(isLNat(V1), isLNat(V2)))
active(isPLNat(splitAt(V1, V2))) → mark(and(isNatural(V1), isLNat(V2)))
active(natsFrom(N)) → mark(U41(isNatural(N), N))
active(sel(N, XS)) → mark(U51(and(isNatural(N), isLNat(XS)), N, XS))
active(snd(pair(X, Y))) → mark(U61(and(isLNat(X), isLNat(Y)), Y))
active(splitAt(0, XS)) → mark(U71(isLNat(XS), XS))
active(splitAt(s(N), cons(X, XS))) → mark(U81(and(isNatural(N), and(isNatural(X), isLNat(XS))), N, X, XS))
active(tail(cons(N, XS))) → mark(U91(and(isNatural(N), isLNat(XS)), XS))
active(take(N, XS)) → mark(U101(and(isNatural(N), isLNat(XS)), N, XS))
active(U101(X1, X2, X3)) → U101(active(X1), X2, X3)
active(fst(X)) → fst(active(X))
active(splitAt(X1, X2)) → splitAt(active(X1), X2)
active(splitAt(X1, X2)) → splitAt(X1, active(X2))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(snd(X)) → snd(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2)) → U41(active(X1), X2)
active(cons(X1, X2)) → cons(active(X1), X2)
active(natsFrom(X)) → natsFrom(active(X))
active(s(X)) → s(active(X))
active(U51(X1, X2, X3)) → U51(active(X1), X2, X3)
active(head(X)) → head(active(X))
active(afterNth(X1, X2)) → afterNth(active(X1), X2)
active(afterNth(X1, X2)) → afterNth(X1, active(X2))
active(U61(X1, X2)) → U61(active(X1), X2)
active(U71(X1, X2)) → U71(active(X1), X2)
active(pair(X1, X2)) → pair(active(X1), X2)
active(pair(X1, X2)) → pair(X1, active(X2))
active(U81(X1, X2, X3, X4)) → U81(active(X1), X2, X3, X4)
active(U82(X1, X2)) → U82(active(X1), X2)
active(U91(X1, X2)) → U91(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(tail(X)) → tail(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
proper(U101(X1, X2, X3)) → U101(proper(X1), proper(X2), proper(X3))
proper(fst(X)) → fst(proper(X))
proper(splitAt(X1, X2)) → splitAt(proper(X1), proper(X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(snd(X)) → snd(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(natsFrom(X)) → natsFrom(proper(X))
proper(s(X)) → s(proper(X))
proper(U51(X1, X2, X3)) → U51(proper(X1), proper(X2), proper(X3))
proper(head(X)) → head(proper(X))
proper(afterNth(X1, X2)) → afterNth(proper(X1), proper(X2))
proper(U61(X1, X2)) → U61(proper(X1), proper(X2))
proper(U71(X1, X2)) → U71(proper(X1), proper(X2))
proper(pair(X1, X2)) → pair(proper(X1), proper(X2))
proper(U81(X1, X2, X3, X4)) → U81(proper(X1), proper(X2), proper(X3), proper(X4))
proper(U82(X1, X2)) → U82(proper(X1), proper(X2))
proper(U91(X1, X2)) → U91(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNatural(X)) → isNatural(proper(X))
proper(isLNat(X)) → isLNat(proper(X))
proper(isPLNat(X)) → isPLNat(proper(X))
proper(tail(X)) → tail(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
proper(sel(X1, X2)) → sel(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))
isNatural(ok(X)) → ok(isNatural(X))
U91(mark(X1), X2) → mark(U91(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U82(mark(X1), X2) → mark(U82(X1, X2))
tail(ok(X)) → ok(tail(X))
U101(ok(X1), ok(X2), ok(X3)) → ok(U101(X1, X2, X3))
U61(ok(X1), ok(X2)) → ok(U61(X1, X2))
snd(ok(X)) → ok(snd(X))
U82(ok(X1), ok(X2)) → ok(U82(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
U51(mark(X1), X2, X3) → mark(U51(X1, X2, X3))
pair(mark(X1), X2) → mark(pair(X1, X2))
U41(mark(X1), X2) → mark(U41(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
isPLNat(ok(X)) → ok(isPLNat(X))
proper(tt) → ok(tt)
proper(nil) → ok(nil)
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
head(mark(X)) → mark(head(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U61(mark(X1), X2) → mark(U61(X1, X2))
natsFrom(ok(X)) → ok(natsFrom(X))
fst(mark(X)) → mark(fst(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
tail(mark(X)) → mark(tail(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
s(ok(X)) → ok(s(X))
U101(mark(X1), X2, X3) → mark(U101(X1, X2, X3))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
proper(0) → ok(0)
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U81(mark(X1), X2, X3, X4) → mark(U81(X1, X2, X3, X4))
take(mark(X1), X2) → mark(take(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
U81(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U81(X1, X2, X3, X4))
snd(mark(X)) → mark(snd(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U51(ok(X1), ok(X2), ok(X3)) → ok(U51(X1, X2, X3))
take(X1, mark(X2)) → mark(take(X1, X2))
head(ok(X)) → ok(head(X))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
isLNat(ok(X)) → ok(isLNat(X))
natsFrom(mark(X)) → mark(natsFrom(X))
U71(mark(X1), X2) → mark(U71(X1, X2))
s(mark(X)) → mark(s(X))
fst(ok(X)) → ok(fst(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
top(mark(X)) → top(proper(X))
U91(ok(X1), ok(X2)) → ok(U91(X1, X2))

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))
isNatural(ok(X)) → ok(isNatural(X))
U91(mark(X1), X2) → mark(U91(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U82(mark(X1), X2) → mark(U82(X1, X2))
tail(ok(X)) → ok(tail(X))
U101(ok(X1), ok(X2), ok(X3)) → ok(U101(X1, X2, X3))
U61(ok(X1), ok(X2)) → ok(U61(X1, X2))
snd(ok(X)) → ok(snd(X))
U82(ok(X1), ok(X2)) → ok(U82(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
U51(mark(X1), X2, X3) → mark(U51(X1, X2, X3))
pair(mark(X1), X2) → mark(pair(X1, X2))
U41(mark(X1), X2) → mark(U41(X1, X2))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
splitAt(mark(X1), X2) → mark(splitAt(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
isPLNat(ok(X)) → ok(isPLNat(X))
proper(tt) → ok(tt)
proper(nil) → ok(nil)
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
splitAt(X1, mark(X2)) → mark(splitAt(X1, X2))
head(mark(X)) → mark(head(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U61(mark(X1), X2) → mark(U61(X1, X2))
natsFrom(ok(X)) → ok(natsFrom(X))
fst(mark(X)) → mark(fst(X))
afterNth(ok(X1), ok(X2)) → ok(afterNth(X1, X2))
tail(mark(X)) → mark(tail(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
s(ok(X)) → ok(s(X))
U101(mark(X1), X2, X3) → mark(U101(X1, X2, X3))
U71(ok(X1), ok(X2)) → ok(U71(X1, X2))
proper(0) → ok(0)
afterNth(X1, mark(X2)) → mark(afterNth(X1, X2))
U81(mark(X1), X2, X3, X4) → mark(U81(X1, X2, X3, X4))
take(mark(X1), X2) → mark(take(X1, X2))
pair(X1, mark(X2)) → mark(pair(X1, X2))
U81(ok(X1), ok(X2), ok(X3), ok(X4)) → ok(U81(X1, X2, X3, X4))
snd(mark(X)) → mark(snd(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U51(ok(X1), ok(X2), ok(X3)) → ok(U51(X1, X2, X3))
take(X1, mark(X2)) → mark(take(X1, X2))
head(ok(X)) → ok(head(X))
pair(ok(X1), ok(X2)) → ok(pair(X1, X2))
afterNth(mark(X1), X2) → mark(afterNth(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
isLNat(ok(X)) → ok(isLNat(X))
natsFrom(mark(X)) → mark(natsFrom(X))
U71(mark(X1), X2) → mark(U71(X1, X2))
s(mark(X)) → mark(s(X))
fst(ok(X)) → ok(fst(X))
splitAt(ok(X1), ok(X2)) → ok(splitAt(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
top(mark(X)) → top(proper(X))
U91(ok(X1), ok(X2)) → ok(U91(X1, X2))

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, 25, 26, 27, 28, 29]
transitions:
ok0(0) → 0
active0(0) → 0
mark0(0) → 0
tt0() → 0
nil0() → 0
00() → 0
top0(0) → 1
isNatural0(0) → 2
U910(0, 0) → 3
cons0(0, 0) → 4
U820(0, 0) → 5
tail0(0) → 6
U1010(0, 0, 0) → 7
U610(0, 0) → 8
snd0(0) → 9
and0(0, 0) → 10
U510(0, 0, 0) → 11
pair0(0, 0) → 12
U410(0, 0) → 13
sel0(0, 0) → 14
splitAt0(0, 0) → 15
isPLNat0(0) → 16
proper0(0) → 17
U110(0, 0, 0) → 18
U310(0, 0) → 19
head0(0) → 20
natsFrom0(0) → 21
fst0(0) → 22
afterNth0(0, 0) → 23
U210(0, 0) → 24
s0(0) → 25
U710(0, 0) → 26
U810(0, 0, 0, 0) → 27
take0(0, 0) → 28
isLNat0(0) → 29
active1(0) → 30
top1(30) → 1
isNatural1(0) → 31
ok1(31) → 2
U911(0, 0) → 32
mark1(32) → 3
cons1(0, 0) → 33
ok1(33) → 4
U821(0, 0) → 34
mark1(34) → 5
tail1(0) → 35
ok1(35) → 6
U1011(0, 0, 0) → 36
ok1(36) → 7
U611(0, 0) → 37
ok1(37) → 8
snd1(0) → 38
ok1(38) → 9
U821(0, 0) → 39
ok1(39) → 5
and1(0, 0) → 40
ok1(40) → 10
U511(0, 0, 0) → 41
mark1(41) → 11
pair1(0, 0) → 42
mark1(42) → 12
U411(0, 0) → 43
mark1(43) → 13
sel1(0, 0) → 44
ok1(44) → 14
splitAt1(0, 0) → 45
mark1(45) → 15
sel1(0, 0) → 46
mark1(46) → 14
isPLNat1(0) → 47
ok1(47) → 16
tt1() → 48
ok1(48) → 17
nil1() → 49
ok1(49) → 17
U111(0, 0, 0) → 50
mark1(50) → 18
U311(0, 0) → 51
ok1(51) → 19
head1(0) → 52
mark1(52) → 20
U111(0, 0, 0) → 53
ok1(53) → 18
U611(0, 0) → 54
mark1(54) → 8
natsFrom1(0) → 55
ok1(55) → 21
fst1(0) → 56
mark1(56) → 22
afterNth1(0, 0) → 57
ok1(57) → 23
tail1(0) → 58
mark1(58) → 6
U211(0, 0) → 59
ok1(59) → 24
s1(0) → 60
ok1(60) → 25
U1011(0, 0, 0) → 61
mark1(61) → 7
U711(0, 0) → 62
ok1(62) → 26
01() → 63
ok1(63) → 17
afterNth1(0, 0) → 64
mark1(64) → 23
U811(0, 0, 0, 0) → 65
mark1(65) → 27
take1(0, 0) → 66
mark1(66) → 28
U811(0, 0, 0, 0) → 67
ok1(67) → 27
snd1(0) → 68
mark1(68) → 9
take1(0, 0) → 69
ok1(69) → 28
U211(0, 0) → 70
mark1(70) → 24
U511(0, 0, 0) → 71
ok1(71) → 11
head1(0) → 72
ok1(72) → 20
pair1(0, 0) → 73
ok1(73) → 12
and1(0, 0) → 74
mark1(74) → 10
U411(0, 0) → 75
ok1(75) → 13
isLNat1(0) → 76
ok1(76) → 29
natsFrom1(0) → 77
mark1(77) → 21
U711(0, 0) → 78
mark1(78) → 26
s1(0) → 79
mark1(79) → 25
fst1(0) → 80
ok1(80) → 22
splitAt1(0, 0) → 81
ok1(81) → 15
U311(0, 0) → 82
mark1(82) → 19
cons1(0, 0) → 83
mark1(83) → 4
proper1(0) → 84
top1(84) → 1
U911(0, 0) → 85
ok1(85) → 3
ok1(31) → 31
mark1(32) → 32
mark1(32) → 85
ok1(33) → 33
ok1(33) → 83
mark1(34) → 34
mark1(34) → 39
ok1(35) → 35
ok1(35) → 58
ok1(36) → 36
ok1(36) → 61
ok1(37) → 37
ok1(37) → 54
ok1(38) → 38
ok1(38) → 68
ok1(39) → 34
ok1(39) → 39
ok1(40) → 40
ok1(40) → 74
mark1(41) → 41
mark1(41) → 71
mark1(42) → 42
mark1(42) → 73
mark1(43) → 43
mark1(43) → 75
ok1(44) → 44
ok1(44) → 46
mark1(45) → 45
mark1(45) → 81
mark1(46) → 44
mark1(46) → 46
ok1(47) → 47
ok1(48) → 84
ok1(49) → 84
mark1(50) → 50
mark1(50) → 53
ok1(51) → 51
ok1(51) → 82
mark1(52) → 52
mark1(52) → 72
ok1(53) → 50
ok1(53) → 53
mark1(54) → 37
mark1(54) → 54
ok1(55) → 55
ok1(55) → 77
mark1(56) → 56
mark1(56) → 80
ok1(57) → 57
ok1(57) → 64
mark1(58) → 35
mark1(58) → 58
ok1(59) → 59
ok1(59) → 70
ok1(60) → 60
ok1(60) → 79
mark1(61) → 36
mark1(61) → 61
ok1(62) → 62
ok1(62) → 78
ok1(63) → 84
mark1(64) → 57
mark1(64) → 64
mark1(65) → 65
mark1(65) → 67
mark1(66) → 66
mark1(66) → 69
ok1(67) → 65
ok1(67) → 67
mark1(68) → 38
mark1(68) → 68
ok1(69) → 66
ok1(69) → 69
mark1(70) → 59
mark1(70) → 70
ok1(71) → 41
ok1(71) → 71
ok1(72) → 52
ok1(72) → 72
ok1(73) → 42
ok1(73) → 73
mark1(74) → 40
mark1(74) → 74
ok1(75) → 43
ok1(75) → 75
ok1(76) → 76
mark1(77) → 55
mark1(77) → 77
mark1(78) → 62
mark1(78) → 78
mark1(79) → 60
mark1(79) → 79
ok1(80) → 56
ok1(80) → 80
ok1(81) → 45
ok1(81) → 81
mark1(82) → 51
mark1(82) → 82
mark1(83) → 33
mark1(83) → 83
ok1(85) → 32
ok1(85) → 85
active2(48) → 86
top2(86) → 1
active2(49) → 86
active2(63) → 86

(6) BOUNDS(1, n^1)