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