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