3.07/1.57	WORST_CASE(NON_POLY, ?)
3.11/1.58	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.11/1.58	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.11/1.58	
3.11/1.58	
3.11/1.58	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.11/1.58	
3.11/1.58	(0) Name of obligation not specified
3.11/1.58	(1) ExtraVarProof [FINISHED, 0 ms]
3.11/1.58	(2) BOUNDS(INF, INF)
3.11/1.58	
3.11/1.58	
3.11/1.58	----------------------------------------
3.11/1.58	
3.11/1.58	(0)
3.11/1.58	Obligation:
3.11/1.58	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.11/1.58	
3.11/1.58	
3.11/1.58	The TRS R consists of the following rules:
3.11/1.58	
3.11/1.58	   U101(tt) -> fst(splitAt(N, XS))
3.11/1.58	   U11(tt) -> snd(splitAt(N, XS))
3.11/1.58	   U21(tt) -> X
3.11/1.58	   U31(tt) -> N
3.11/1.58	   U41(tt) -> cons(N)
3.11/1.58	   U51(tt) -> head(afterNth(N, XS))
3.11/1.58	   U61(tt) -> Y
3.11/1.58	   U71(tt) -> pair(nil, XS)
3.11/1.58	   U81(tt) -> U82(splitAt(N, XS))
3.11/1.58	   U82(pair(YS, ZS)) -> pair(cons(X), ZS)
3.11/1.58	   U91(tt) -> XS
3.11/1.58	   and(tt) -> X
3.11/1.58	   afterNth(N, XS) -> U11(and(isNatural))
3.11/1.58	   fst(pair(X, Y)) -> U21(and(isLNat))
3.11/1.58	   head(cons(N)) -> U31(and(isNatural))
3.11/1.58	   isLNat -> tt
3.11/1.58	   isLNat -> and(isNatural)
3.11/1.58	   isLNat -> isPLNat
3.11/1.58	   isLNat -> isNatural
3.11/1.58	   isLNat -> isLNat
3.11/1.58	   isNatural -> tt
3.11/1.58	   isNatural -> isLNat
3.11/1.58	   isNatural -> isNatural
3.11/1.58	   isNatural -> and(isNatural)
3.11/1.58	   isPLNat -> and(isLNat)
3.11/1.58	   isPLNat -> and(isNatural)
3.11/1.58	   natsFrom(N) -> U41(isNatural)
3.11/1.58	   sel(N, XS) -> U51(and(isNatural))
3.11/1.58	   snd(pair(X, Y)) -> U61(and(isLNat))
3.11/1.58	   splitAt(0, XS) -> U71(isLNat)
3.11/1.58	   splitAt(s(N), cons(X)) -> U81(and(isNatural))
3.11/1.58	   tail(cons(N)) -> U91(and(isNatural))
3.11/1.58	   take(N, XS) -> U101(and(isNatural))
3.11/1.58	
3.11/1.58	
3.11/1.58	----------------------------------------
3.11/1.58	
3.11/1.58	(1) ExtraVarProof (FINISHED)
3.11/1.58	unbounded runtime complexity due to extra variable on rhs
3.11/1.58	----------------------------------------
3.11/1.58	
3.11/1.58	(2)
3.11/1.58	BOUNDS(INF, INF)
3.13/1.61	EOF