2.96/1.50	WORST_CASE(NON_POLY, ?)
3.04/1.50	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.04/1.50	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.04/1.50	
3.04/1.50	
3.04/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.04/1.50	
3.04/1.50	(0) Name of obligation not specified
3.04/1.50	(1) ExtraVarProof [FINISHED, 0 ms]
3.04/1.50	(2) BOUNDS(INF, INF)
3.04/1.50	
3.04/1.50	
3.04/1.50	----------------------------------------
3.04/1.50	
3.04/1.50	(0)
3.04/1.50	Obligation:
3.04/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.04/1.50	
3.04/1.50	
3.04/1.50	The TRS R consists of the following rules:
3.04/1.50	
3.04/1.50	   splitAt(s(N), cons(X)) -> u(splitAt(N, XS))
3.04/1.50	   u(pair(YS, ZS)) -> pair(cons(X), ZS)
3.04/1.50	   tail(cons(N)) -> XS
3.04/1.50	   natsFrom(N) -> cons(N)
3.04/1.50	   fst(pair(XS, YS)) -> XS
3.04/1.50	   snd(pair(XS, YS)) -> YS
3.04/1.50	   splitAt(0, XS) -> pair(nil, XS)
3.04/1.50	   head(cons(N)) -> N
3.04/1.50	   sel(N, XS) -> head(afterNth(N, XS))
3.04/1.50	   take(N, XS) -> fst(splitAt(N, XS))
3.04/1.50	   afterNth(N, XS) -> snd(splitAt(N, XS))
3.04/1.50	
3.04/1.50	
3.04/1.50	----------------------------------------
3.04/1.50	
3.04/1.50	(1) ExtraVarProof (FINISHED)
3.04/1.50	unbounded runtime complexity due to extra variable on rhs
3.04/1.50	----------------------------------------
3.04/1.50	
3.04/1.50	(2)
3.04/1.50	BOUNDS(INF, INF)
3.07/1.53	EOF