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