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