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