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