MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { U101(tt(), N, XS) -> fst(splitAt(activate(N), activate(XS))) , fst(X) -> n__fst(X) , fst(pair(X, Y)) -> U21(and(isLNat(X), n__isLNat(Y)), X) , splitAt(X1, X2) -> n__splitAt(X1, X2) , splitAt(s(N), cons(X, XS)) -> U81(and(isNatural(N), n__and(isNatural(X), n__isLNat(activate(XS)))), N, X, activate(XS)) , splitAt(0(), XS) -> U71(isLNat(XS), XS) , activate(X) -> X , activate(n__natsFrom(X)) -> natsFrom(X) , activate(n__isLNat(X)) -> isLNat(X) , activate(n__nil()) -> nil() , activate(n__afterNth(X1, X2)) -> afterNth(X1, X2) , activate(n__cons(X1, X2)) -> cons(X1, X2) , activate(n__fst(X)) -> fst(X) , activate(n__snd(X)) -> snd(X) , activate(n__tail(X)) -> tail(X) , activate(n__take(X1, X2)) -> take(X1, X2) , activate(n__0()) -> 0() , activate(n__head(X)) -> head(X) , activate(n__s(X)) -> s(X) , activate(n__sel(X1, X2)) -> sel(X1, X2) , activate(n__pair(X1, X2)) -> pair(X1, X2) , activate(n__splitAt(X1, X2)) -> splitAt(X1, X2) , activate(n__and(X1, X2)) -> and(X1, X2) , U11(tt(), N, XS) -> snd(splitAt(activate(N), activate(XS))) , snd(X) -> n__snd(X) , snd(pair(X, Y)) -> U61(and(isLNat(X), n__isLNat(Y)), Y) , U21(tt(), X) -> activate(X) , U31(tt(), N) -> activate(N) , U41(tt(), N) -> cons(activate(N), n__natsFrom(s(activate(N)))) , cons(X1, X2) -> n__cons(X1, X2) , s(X) -> n__s(X) , U51(tt(), N, XS) -> head(afterNth(activate(N), activate(XS))) , head(X) -> n__head(X) , head(cons(N, XS)) -> U31(and(isNatural(N), n__isLNat(activate(XS))), N) , afterNth(N, XS) -> U11(and(isNatural(N), n__isLNat(XS)), N, XS) , afterNth(X1, X2) -> n__afterNth(X1, X2) , U61(tt(), Y) -> activate(Y) , U71(tt(), XS) -> pair(nil(), activate(XS)) , pair(X1, X2) -> n__pair(X1, X2) , nil() -> n__nil() , U81(tt(), N, X, XS) -> U82(splitAt(activate(N), activate(XS)), activate(X)) , U82(pair(YS, ZS), X) -> pair(cons(activate(X), YS), ZS) , U91(tt(), XS) -> activate(XS) , and(X1, X2) -> n__and(X1, X2) , and(tt(), X) -> activate(X) , isNatural(n__0()) -> tt() , isNatural(n__head(V1)) -> isLNat(activate(V1)) , isNatural(n__s(V1)) -> isNatural(activate(V1)) , isNatural(n__sel(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(X) -> n__isLNat(X) , isLNat(n__natsFrom(V1)) -> isNatural(activate(V1)) , isLNat(n__nil()) -> tt() , isLNat(n__afterNth(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(n__cons(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(n__fst(V1)) -> isPLNat(activate(V1)) , isLNat(n__snd(V1)) -> isPLNat(activate(V1)) , isLNat(n__tail(V1)) -> isLNat(activate(V1)) , isLNat(n__take(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isPLNat(n__pair(V1, V2)) -> and(isLNat(activate(V1)), n__isLNat(activate(V2))) , isPLNat(n__splitAt(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , natsFrom(N) -> U41(isNatural(N), N) , natsFrom(X) -> n__natsFrom(X) , sel(N, XS) -> U51(and(isNatural(N), n__isLNat(XS)), N, XS) , sel(X1, X2) -> n__sel(X1, X2) , 0() -> n__0() , tail(X) -> n__tail(X) , tail(cons(N, XS)) -> U91(and(isNatural(N), n__isLNat(activate(XS))), activate(XS)) , take(N, XS) -> U101(and(isNatural(N), n__isLNat(XS)), N, XS) , take(X1, X2) -> n__take(X1, X2) } Obligation: innermost runtime complexity Answer: MAYBE Arguments of following rules are not normal-forms: { fst(pair(X, Y)) -> U21(and(isLNat(X), n__isLNat(Y)), X) , splitAt(s(N), cons(X, XS)) -> U81(and(isNatural(N), n__and(isNatural(X), n__isLNat(activate(XS)))), N, X, activate(XS)) , splitAt(0(), XS) -> U71(isLNat(XS), XS) , snd(pair(X, Y)) -> U61(and(isLNat(X), n__isLNat(Y)), Y) , head(cons(N, XS)) -> U31(and(isNatural(N), n__isLNat(activate(XS))), N) , U82(pair(YS, ZS), X) -> pair(cons(activate(X), YS), ZS) , tail(cons(N, XS)) -> U91(and(isNatural(N), n__isLNat(activate(XS))), activate(XS)) } All above mentioned rules can be savely removed. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { U101(tt(), N, XS) -> fst(splitAt(activate(N), activate(XS))) , fst(X) -> n__fst(X) , splitAt(X1, X2) -> n__splitAt(X1, X2) , activate(X) -> X , activate(n__natsFrom(X)) -> natsFrom(X) , activate(n__isLNat(X)) -> isLNat(X) , activate(n__nil()) -> nil() , activate(n__afterNth(X1, X2)) -> afterNth(X1, X2) , activate(n__cons(X1, X2)) -> cons(X1, X2) , activate(n__fst(X)) -> fst(X) , activate(n__snd(X)) -> snd(X) , activate(n__tail(X)) -> tail(X) , activate(n__take(X1, X2)) -> take(X1, X2) , activate(n__0()) -> 0() , activate(n__head(X)) -> head(X) , activate(n__s(X)) -> s(X) , activate(n__sel(X1, X2)) -> sel(X1, X2) , activate(n__pair(X1, X2)) -> pair(X1, X2) , activate(n__splitAt(X1, X2)) -> splitAt(X1, X2) , activate(n__and(X1, X2)) -> and(X1, X2) , U11(tt(), N, XS) -> snd(splitAt(activate(N), activate(XS))) , snd(X) -> n__snd(X) , U21(tt(), X) -> activate(X) , U31(tt(), N) -> activate(N) , U41(tt(), N) -> cons(activate(N), n__natsFrom(s(activate(N)))) , cons(X1, X2) -> n__cons(X1, X2) , s(X) -> n__s(X) , U51(tt(), N, XS) -> head(afterNth(activate(N), activate(XS))) , head(X) -> n__head(X) , afterNth(N, XS) -> U11(and(isNatural(N), n__isLNat(XS)), N, XS) , afterNth(X1, X2) -> n__afterNth(X1, X2) , U61(tt(), Y) -> activate(Y) , U71(tt(), XS) -> pair(nil(), activate(XS)) , pair(X1, X2) -> n__pair(X1, X2) , nil() -> n__nil() , U81(tt(), N, X, XS) -> U82(splitAt(activate(N), activate(XS)), activate(X)) , U91(tt(), XS) -> activate(XS) , and(X1, X2) -> n__and(X1, X2) , and(tt(), X) -> activate(X) , isNatural(n__0()) -> tt() , isNatural(n__head(V1)) -> isLNat(activate(V1)) , isNatural(n__s(V1)) -> isNatural(activate(V1)) , isNatural(n__sel(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(X) -> n__isLNat(X) , isLNat(n__natsFrom(V1)) -> isNatural(activate(V1)) , isLNat(n__nil()) -> tt() , isLNat(n__afterNth(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(n__cons(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isLNat(n__fst(V1)) -> isPLNat(activate(V1)) , isLNat(n__snd(V1)) -> isPLNat(activate(V1)) , isLNat(n__tail(V1)) -> isLNat(activate(V1)) , isLNat(n__take(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , isPLNat(n__pair(V1, V2)) -> and(isLNat(activate(V1)), n__isLNat(activate(V2))) , isPLNat(n__splitAt(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) , natsFrom(N) -> U41(isNatural(N), N) , natsFrom(X) -> n__natsFrom(X) , sel(N, XS) -> U51(and(isNatural(N), n__isLNat(XS)), N, XS) , sel(X1, X2) -> n__sel(X1, X2) , 0() -> n__0() , tail(X) -> n__tail(X) , take(N, XS) -> U101(and(isNatural(N), n__isLNat(XS)), N, XS) , take(X1, X2) -> n__take(X1, X2) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 60.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 30.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..