2.65/1.51	WORST_CASE(NON_POLY, ?)
2.65/1.51	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.65/1.51	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.65/1.51	
2.65/1.51	
2.65/1.51	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.65/1.51	
2.65/1.51	(0) Name of obligation not specified
2.65/1.51	(1) ExtraVarProof [FINISHED, 0 ms]
2.65/1.51	(2) BOUNDS(INF, INF)
2.65/1.51	
2.65/1.51	
2.65/1.51	----------------------------------------
2.65/1.51	
2.65/1.51	(0)
2.65/1.51	Obligation:
2.65/1.51	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.65/1.51	
2.65/1.51	
2.65/1.51	The TRS R consists of the following rules:
2.65/1.51	
2.65/1.51	   2ndspos(s(N), cons(X)) -> rcons(posrecip(Y), 2ndsneg(N, Z))
2.65/1.51	   2ndsneg(s(N), cons(X)) -> rcons(negrecip(Y), 2ndspos(N, Z))
2.65/1.51	   from(X) -> cons(X)
2.65/1.51	   2ndspos(0, Z) -> rnil
2.65/1.51	   2ndsneg(0, Z) -> rnil
2.65/1.51	   pi(X) -> 2ndspos(X, from(0))
2.65/1.51	   plus(0, Y) -> Y
2.65/1.51	   plus(s(X), Y) -> s(plus(X, Y))
2.65/1.51	   times(0, Y) -> 0
2.65/1.51	   times(s(X), Y) -> plus(Y, times(X, Y))
2.65/1.51	   square(X) -> times(X, X)
2.65/1.51	
2.65/1.51	
2.65/1.51	----------------------------------------
2.65/1.51	
2.65/1.51	(1) ExtraVarProof (FINISHED)
2.65/1.51	unbounded runtime complexity due to extra variable on rhs
2.65/1.51	----------------------------------------
2.65/1.51	
2.65/1.51	(2)
2.65/1.51	BOUNDS(INF, INF)
2.83/1.55	EOF