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