2.98/1.47	WORST_CASE(NON_POLY, ?)
2.98/1.47	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.98/1.47	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.98/1.47	
2.98/1.47	
2.98/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.98/1.47	
2.98/1.47	(0) Name of obligation not specified
2.98/1.47	(1) ExtraVarProof [FINISHED, 0 ms]
2.98/1.47	(2) BOUNDS(INF, INF)
2.98/1.47	
2.98/1.47	
2.98/1.47	----------------------------------------
2.98/1.47	
2.98/1.47	(0)
2.98/1.47	Obligation:
2.98/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.98/1.47	
2.98/1.47	
2.98/1.47	The TRS R consists of the following rules:
2.98/1.47	
2.98/1.47	   sel(s(N), cons(X)) -> sel(N, XS)
2.98/1.47	   from(X) -> cons(X)
2.98/1.47	   sel(0, cons(X)) -> X
2.98/1.47	   minus(X, 0) -> 0
2.98/1.47	   minus(s(X), s(Y)) -> minus(X, Y)
2.98/1.47	   quot(0, s(Y)) -> 0
2.98/1.47	   quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
2.98/1.47	   zWquot(XS, nil) -> nil
2.98/1.47	   zWquot(nil, XS) -> nil
2.98/1.47	   zWquot(cons(X), cons(Y)) -> cons(quot(X, Y))
2.98/1.47	
2.98/1.47	
2.98/1.47	----------------------------------------
2.98/1.47	
2.98/1.47	(1) ExtraVarProof (FINISHED)
2.98/1.47	unbounded runtime complexity due to extra variable on rhs
2.98/1.47	----------------------------------------
2.98/1.48	
2.98/1.48	(2)
2.98/1.48	BOUNDS(INF, INF)
3.01/1.51	EOF