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