2.93/1.53	WORST_CASE(NON_POLY, ?)
2.93/1.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.93/1.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.93/1.53	
2.93/1.53	
2.93/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.93/1.53	
2.93/1.53	(0) Name of obligation not specified
2.93/1.53	(1) ExtraVarProof [FINISHED, 0 ms]
2.93/1.53	(2) BOUNDS(INF, INF)
2.93/1.53	
2.93/1.53	
2.93/1.53	----------------------------------------
2.93/1.53	
2.93/1.53	(0)
2.93/1.53	Obligation:
2.93/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.93/1.53	
2.93/1.53	
2.93/1.53	The TRS R consists of the following rules:
2.93/1.53	
2.93/1.53	   tail(cons(X)) -> L
2.93/1.53	   incr(nil) -> nil
2.93/1.53	   incr(cons(X)) -> cons(s(X))
2.93/1.53	   adx(nil) -> nil
2.93/1.53	   adx(cons(X)) -> incr(cons(X))
2.93/1.53	   nats -> adx(zeros)
2.93/1.53	   zeros -> cons(0)
2.93/1.53	   head(cons(X)) -> X
2.93/1.53	
2.93/1.53	
2.93/1.53	----------------------------------------
2.93/1.53	
2.93/1.53	(1) ExtraVarProof (FINISHED)
2.93/1.53	unbounded runtime complexity due to extra variable on rhs
2.93/1.53	----------------------------------------
2.93/1.53	
2.93/1.53	(2)
2.93/1.53	BOUNDS(INF, INF)
2.93/1.56	EOF