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