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