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