3.00/1.55 WORST_CASE(NON_POLY, ?) 3.12/1.55 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.12/1.55 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.12/1.55 3.12/1.55 3.12/1.55 The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). 3.12/1.55 3.12/1.55 (0) Name of obligation not specified 3.12/1.55 (1) ExtraVarProof [FINISHED, 0 ms] 3.12/1.55 (2) BOUNDS(INF, INF) 3.12/1.55 3.12/1.55 3.12/1.55 ---------------------------------------- 3.12/1.55 3.12/1.55 (0) 3.12/1.55 Obligation: 3.12/1.55 The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). 3.12/1.55 3.12/1.55 3.12/1.55 The TRS R consists of the following rules: 3.12/1.55 3.12/1.55 U12(tt) -> snd(splitAt(N, XS)) 3.12/1.55 U22(tt) -> X 3.12/1.55 U32(tt) -> N 3.12/1.55 U42(tt) -> head(afterNth(N, XS)) 3.12/1.55 U52(tt) -> Y 3.12/1.55 U63(tt) -> U64(splitAt(N, XS)) 3.12/1.55 U64(pair(YS, ZS)) -> pair(cons(X), ZS) 3.12/1.55 U72(tt) -> XS 3.12/1.55 U82(tt) -> fst(splitAt(N, XS)) 3.12/1.55 U11(tt) -> U12(tt) 3.12/1.55 U21(tt) -> U22(tt) 3.12/1.55 U31(tt) -> U32(tt) 3.12/1.55 U41(tt) -> U42(tt) 3.12/1.55 U51(tt) -> U52(tt) 3.12/1.55 U61(tt) -> U62(tt) 3.12/1.55 U62(tt) -> U63(tt) 3.12/1.55 U71(tt) -> U72(tt) 3.12/1.55 U81(tt) -> U82(tt) 3.12/1.55 afterNth(N, XS) -> U11(tt) 3.12/1.55 fst(pair(X, Y)) -> U21(tt) 3.12/1.55 head(cons(N)) -> U31(tt) 3.12/1.55 natsFrom(N) -> cons(N) 3.12/1.55 sel(N, XS) -> U41(tt) 3.12/1.55 snd(pair(X, Y)) -> U51(tt) 3.12/1.55 splitAt(0, XS) -> pair(nil, XS) 3.12/1.55 splitAt(s(N), cons(X)) -> U61(tt) 3.12/1.55 tail(cons(N)) -> U71(tt) 3.12/1.55 take(N, XS) -> U81(tt) 3.12/1.55 3.12/1.55 3.12/1.55 ---------------------------------------- 3.12/1.55 3.12/1.55 (1) ExtraVarProof (FINISHED) 3.12/1.55 unbounded runtime complexity due to extra variable on rhs 3.12/1.55 ---------------------------------------- 3.12/1.55 3.12/1.55 (2) 3.12/1.55 BOUNDS(INF, INF) 3.12/1.60 EOF