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