3.18/1.53	WORST_CASE(NON_POLY, ?)
3.18/1.54	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.18/1.54	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.18/1.54	
3.18/1.54	
3.18/1.54	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.18/1.54	
3.18/1.54	(0) Name of obligation not specified
3.18/1.54	(1) ExtraVarProof [FINISHED, 0 ms]
3.18/1.54	(2) BOUNDS(INF, INF)
3.18/1.54	
3.18/1.54	
3.18/1.54	----------------------------------------
3.18/1.54	
3.18/1.54	(0)
3.18/1.54	Obligation:
3.18/1.54	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.18/1.54	
3.18/1.54	
3.18/1.54	The TRS R consists of the following rules:
3.18/1.54	
3.18/1.54	   U114(tt) -> s(length(L))
3.18/1.54	   U136(tt) -> cons(N)
3.18/1.54	   zeros -> cons(0)
3.18/1.54	   U101(tt) -> U102(isNatKind)
3.18/1.54	   U102(tt) -> U103(isNatIListKind)
3.18/1.54	   U103(tt) -> U104(isNatIListKind)
3.18/1.54	   U104(tt) -> U105(isNat)
3.18/1.54	   U105(tt) -> U106(isNatIList)
3.18/1.54	   U106(tt) -> tt
3.18/1.54	   U11(tt) -> U12(isNatIListKind)
3.18/1.54	   U111(tt) -> U112(isNatIListKind)
3.18/1.54	   U112(tt) -> U113(isNat)
3.18/1.54	   U113(tt) -> U114(isNatKind)
3.18/1.54	   U12(tt) -> U13(isNatList)
3.18/1.54	   U121(tt) -> U122(isNatIListKind)
3.18/1.54	   U122(tt) -> nil
3.18/1.54	   U13(tt) -> tt
3.18/1.54	   U131(tt) -> U132(isNatIListKind)
3.18/1.54	   U132(tt) -> U133(isNat)
3.18/1.54	   U133(tt) -> U134(isNatKind)
3.18/1.54	   U134(tt) -> U135(isNat)
3.18/1.54	   U135(tt) -> U136(isNatKind)
3.18/1.54	   U21(tt) -> U22(isNatKind)
3.18/1.54	   U22(tt) -> U23(isNat)
3.18/1.54	   U23(tt) -> tt
3.18/1.54	   U31(tt) -> U32(isNatIListKind)
3.18/1.54	   U32(tt) -> U33(isNatList)
3.18/1.54	   U33(tt) -> tt
3.18/1.54	   U41(tt) -> U42(isNatKind)
3.18/1.54	   U42(tt) -> U43(isNatIListKind)
3.18/1.54	   U43(tt) -> U44(isNatIListKind)
3.18/1.54	   U44(tt) -> U45(isNat)
3.18/1.54	   U45(tt) -> U46(isNatIList)
3.18/1.54	   U46(tt) -> tt
3.18/1.54	   U51(tt) -> U52(isNatIListKind)
3.18/1.54	   U52(tt) -> tt
3.18/1.54	   U61(tt) -> U62(isNatIListKind)
3.18/1.54	   U62(tt) -> tt
3.18/1.54	   U71(tt) -> tt
3.18/1.54	   U81(tt) -> tt
3.18/1.54	   U91(tt) -> U92(isNatKind)
3.18/1.54	   U92(tt) -> U93(isNatIListKind)
3.18/1.54	   U93(tt) -> U94(isNatIListKind)
3.18/1.54	   U94(tt) -> U95(isNat)
3.18/1.54	   U95(tt) -> U96(isNatList)
3.18/1.54	   U96(tt) -> tt
3.18/1.54	   isNat -> tt
3.18/1.54	   isNat -> U11(isNatIListKind)
3.18/1.54	   isNat -> U21(isNatKind)
3.18/1.54	   isNatIList -> U31(isNatIListKind)
3.18/1.54	   isNatIList -> tt
3.18/1.54	   isNatIList -> U41(isNatKind)
3.18/1.54	   isNatIListKind -> tt
3.18/1.54	   isNatIListKind -> U51(isNatKind)
3.18/1.54	   isNatIListKind -> U61(isNatKind)
3.18/1.54	   isNatKind -> tt
3.18/1.54	   isNatKind -> U71(isNatIListKind)
3.18/1.54	   isNatKind -> U81(isNatKind)
3.18/1.54	   isNatList -> tt
3.18/1.54	   isNatList -> U91(isNatKind)
3.18/1.54	   isNatList -> U101(isNatKind)
3.18/1.54	   length(nil) -> 0
3.18/1.54	   length(cons(N)) -> U111(isNatList)
3.18/1.54	   take(0, IL) -> U121(isNatIList)
3.18/1.54	   take(s(M), cons(N)) -> U131(isNatIList)
3.18/1.54	
3.18/1.54	
3.18/1.54	----------------------------------------
3.18/1.54	
3.18/1.54	(1) ExtraVarProof (FINISHED)
3.18/1.54	unbounded runtime complexity due to extra variable on rhs
3.18/1.54	----------------------------------------
3.18/1.54	
3.18/1.54	(2)
3.18/1.54	BOUNDS(INF, INF)
3.18/1.56	EOF