3.02/1.53	WORST_CASE(NON_POLY, ?)
3.02/1.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.02/1.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.02/1.53	
3.02/1.53	
3.02/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.53	
3.02/1.53	(0) Name of obligation not specified
3.02/1.53	(1) ExtraVarProof [FINISHED, 0 ms]
3.02/1.53	(2) BOUNDS(INF, INF)
3.02/1.53	
3.02/1.53	
3.02/1.53	----------------------------------------
3.02/1.53	
3.02/1.53	(0)
3.02/1.53	Obligation:
3.02/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.53	
3.02/1.53	
3.02/1.53	The TRS R consists of the following rules:
3.02/1.53	
3.02/1.53	   tail(cons(X)) -> XS
3.02/1.53	   pairNs -> cons(0)
3.02/1.53	   oddNs -> incr(pairNs)
3.02/1.53	   incr(cons(X)) -> cons(s(X))
3.02/1.53	   take(0, XS) -> nil
3.02/1.53	   take(s(N), cons(X)) -> cons(X)
3.02/1.53	   zip(nil, XS) -> nil
3.02/1.53	   zip(X, nil) -> nil
3.02/1.53	   zip(cons(X), cons(Y)) -> cons(pair(X, Y))
3.02/1.53	   repItems(nil) -> nil
3.02/1.53	   repItems(cons(X)) -> cons(X)
3.02/1.53	
3.02/1.53	
3.02/1.53	----------------------------------------
3.02/1.53	
3.02/1.53	(1) ExtraVarProof (FINISHED)
3.02/1.53	unbounded runtime complexity due to extra variable on rhs
3.02/1.53	----------------------------------------
3.02/1.53	
3.02/1.53	(2)
3.02/1.53	BOUNDS(INF, INF)
3.11/1.56	EOF