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