2.68/1.58 WORST_CASE(NON_POLY, ?) 2.68/1.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 2.68/1.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.68/1.58 2.68/1.58 2.68/1.58 The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). 2.68/1.58 2.68/1.58 (0) Name of obligation not specified 2.68/1.58 (1) ExtraVarProof [FINISHED, 0 ms] 2.68/1.58 (2) BOUNDS(INF, INF) 2.68/1.58 2.68/1.58 2.68/1.58 ---------------------------------------- 2.68/1.58 2.68/1.58 (0) 2.68/1.58 Obligation: 2.68/1.58 The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). 2.68/1.58 2.68/1.58 2.68/1.58 The TRS R consists of the following rules: 2.68/1.58 2.68/1.58 U72(tt) -> s(length(L)) 2.68/1.58 U93(tt) -> cons(N) 2.68/1.58 zeros -> cons(0) 2.68/1.58 U11(tt) -> tt 2.68/1.58 U21(tt) -> tt 2.68/1.58 U31(tt) -> tt 2.68/1.58 U41(tt) -> U42(isNatIList) 2.68/1.58 U42(tt) -> tt 2.68/1.58 U51(tt) -> U52(isNatList) 2.68/1.58 U52(tt) -> tt 2.68/1.58 U61(tt) -> U62(isNatIList) 2.68/1.58 U62(tt) -> tt 2.68/1.58 U71(tt) -> U72(isNat) 2.68/1.58 U81(tt) -> nil 2.68/1.58 U91(tt) -> U92(isNat) 2.68/1.58 U92(tt) -> U93(isNat) 2.68/1.58 isNat -> tt 2.68/1.58 isNat -> U11(isNatList) 2.68/1.58 isNat -> U21(isNat) 2.68/1.58 isNatIList -> U31(isNatList) 2.68/1.58 isNatIList -> tt 2.68/1.58 isNatIList -> U41(isNat) 2.68/1.58 isNatList -> tt 2.68/1.58 isNatList -> U51(isNat) 2.68/1.58 isNatList -> U61(isNat) 2.68/1.58 length(nil) -> 0 2.68/1.58 length(cons(N)) -> U71(isNatList) 2.68/1.58 take(0, IL) -> U81(isNatIList) 2.68/1.58 take(s(M), cons(N)) -> U91(isNatIList) 2.68/1.58 2.68/1.58 2.68/1.58 ---------------------------------------- 2.68/1.58 2.68/1.58 (1) ExtraVarProof (FINISHED) 2.68/1.58 unbounded runtime complexity due to extra variable on rhs 2.68/1.58 ---------------------------------------- 2.68/1.58 2.68/1.58 (2) 2.68/1.58 BOUNDS(INF, INF) 2.89/1.62 EOF