MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { zeros() -> cons(0(), n__zeros()) , zeros() -> n__zeros() , cons(X1, X2) -> n__cons(X1, X2) , 0() -> n__0() , U11(tt()) -> tt() , U21(tt()) -> tt() , U31(tt()) -> tt() , U41(tt(), V2) -> U42(isNatIList(activate(V2))) , U42(tt()) -> tt() , isNatIList(V) -> U31(isNatList(activate(V))) , isNatIList(n__zeros()) -> tt() , isNatIList(n__cons(V1, V2)) -> U41(isNat(activate(V1)), activate(V2)) , activate(X) -> X , activate(n__zeros()) -> zeros() , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) , activate(n__0()) -> 0() , activate(n__length(X)) -> length(activate(X)) , activate(n__s(X)) -> s(activate(X)) , activate(n__cons(X1, X2)) -> cons(activate(X1), X2) , activate(n__nil()) -> nil() , U51(tt(), V2) -> U52(isNatList(activate(V2))) , U52(tt()) -> tt() , isNatList(n__take(V1, V2)) -> U61(isNat(activate(V1)), activate(V2)) , isNatList(n__cons(V1, V2)) -> U51(isNat(activate(V1)), activate(V2)) , isNatList(n__nil()) -> tt() , U61(tt(), V2) -> U62(isNatIList(activate(V2))) , U62(tt()) -> tt() , U71(tt(), L, N) -> U72(isNat(activate(N)), activate(L)) , U72(tt(), L) -> s(length(activate(L))) , isNat(n__0()) -> tt() , isNat(n__length(V1)) -> U11(isNatList(activate(V1))) , isNat(n__s(V1)) -> U21(isNat(activate(V1))) , s(X) -> n__s(X) , length(X) -> n__length(X) , length(cons(N, L)) -> U71(isNatList(activate(L)), activate(L), N) , length(nil()) -> 0() , U81(tt()) -> nil() , nil() -> n__nil() , U91(tt(), IL, M, N) -> U92(isNat(activate(M)), activate(IL), activate(M), activate(N)) , U92(tt(), IL, M, N) -> U93(isNat(activate(N)), activate(IL), activate(M), activate(N)) , U93(tt(), IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) , take(X1, X2) -> n__take(X1, X2) , take(0(), IL) -> U81(isNatIList(IL)) , take(s(M), cons(N, IL)) -> U91(isNatIList(activate(IL)), activate(IL), M, N) } Obligation: innermost runtime complexity Answer: MAYBE Arguments of following rules are not normal-forms: { length(cons(N, L)) -> U71(isNatList(activate(L)), activate(L), N) , length(nil()) -> 0() , take(0(), IL) -> U81(isNatIList(IL)) , take(s(M), cons(N, IL)) -> U91(isNatIList(activate(IL)), activate(IL), M, N) } All above mentioned rules can be savely removed. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { zeros() -> cons(0(), n__zeros()) , zeros() -> n__zeros() , cons(X1, X2) -> n__cons(X1, X2) , 0() -> n__0() , U11(tt()) -> tt() , U21(tt()) -> tt() , U31(tt()) -> tt() , U41(tt(), V2) -> U42(isNatIList(activate(V2))) , U42(tt()) -> tt() , isNatIList(V) -> U31(isNatList(activate(V))) , isNatIList(n__zeros()) -> tt() , isNatIList(n__cons(V1, V2)) -> U41(isNat(activate(V1)), activate(V2)) , activate(X) -> X , activate(n__zeros()) -> zeros() , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) , activate(n__0()) -> 0() , activate(n__length(X)) -> length(activate(X)) , activate(n__s(X)) -> s(activate(X)) , activate(n__cons(X1, X2)) -> cons(activate(X1), X2) , activate(n__nil()) -> nil() , U51(tt(), V2) -> U52(isNatList(activate(V2))) , U52(tt()) -> tt() , isNatList(n__take(V1, V2)) -> U61(isNat(activate(V1)), activate(V2)) , isNatList(n__cons(V1, V2)) -> U51(isNat(activate(V1)), activate(V2)) , isNatList(n__nil()) -> tt() , U61(tt(), V2) -> U62(isNatIList(activate(V2))) , U62(tt()) -> tt() , U71(tt(), L, N) -> U72(isNat(activate(N)), activate(L)) , U72(tt(), L) -> s(length(activate(L))) , isNat(n__0()) -> tt() , isNat(n__length(V1)) -> U11(isNatList(activate(V1))) , isNat(n__s(V1)) -> U21(isNat(activate(V1))) , s(X) -> n__s(X) , length(X) -> n__length(X) , U81(tt()) -> nil() , nil() -> n__nil() , U91(tt(), IL, M, N) -> U92(isNat(activate(M)), activate(IL), activate(M), activate(N)) , U92(tt(), IL, M, N) -> U93(isNat(activate(N)), activate(IL), activate(M), activate(N)) , U93(tt(), IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) , 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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'bsearch-popstar (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 perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..