3.02/1.54	WORST_CASE(NON_POLY, ?)
3.02/1.55	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.02/1.55	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.02/1.55	
3.02/1.55	
3.02/1.55	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.55	
3.02/1.55	(0) Name of obligation not specified
3.02/1.55	(1) ExtraVarProof [FINISHED, 0 ms]
3.02/1.55	(2) BOUNDS(INF, INF)
3.02/1.55	
3.02/1.55	
3.02/1.55	----------------------------------------
3.02/1.55	
3.02/1.55	(0)
3.02/1.55	Obligation:
3.02/1.55	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.55	
3.02/1.55	
3.02/1.55	The TRS R consists of the following rules:
3.02/1.55	
3.02/1.55	   U11(tt) -> s(length(L))
3.02/1.55	   U31(tt) -> cons(N)
3.02/1.55	   and(tt) -> X
3.02/1.55	   zeros -> cons(0)
3.02/1.55	   U21(tt) -> nil
3.02/1.55	   isNat -> tt
3.02/1.55	   isNat -> isNatList
3.02/1.55	   isNat -> isNat
3.02/1.55	   isNatIList -> isNatList
3.02/1.55	   isNatIList -> tt
3.02/1.55	   isNatIList -> and(isNat)
3.02/1.55	   isNatList -> tt
3.02/1.55	   isNatList -> and(isNat)
3.02/1.55	   length(nil) -> 0
3.02/1.55	   length(cons(N)) -> U11(and(isNatList))
3.02/1.55	   take(0, IL) -> U21(isNatIList)
3.02/1.55	   take(s(M), cons(N)) -> U31(and(isNatIList))
3.02/1.55	
3.02/1.55	
3.02/1.55	----------------------------------------
3.02/1.55	
3.02/1.55	(1) ExtraVarProof (FINISHED)
3.02/1.55	unbounded runtime complexity due to extra variable on rhs
3.02/1.55	----------------------------------------
3.02/1.55	
3.02/1.55	(2)
3.02/1.55	BOUNDS(INF, INF)
3.14/1.59	EOF