2.98/1.62	WORST_CASE(NON_POLY, ?)
2.98/1.63	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.98/1.63	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.98/1.63	
2.98/1.63	
2.98/1.63	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.98/1.63	
2.98/1.63	(0) Name of obligation not specified
2.98/1.63	(1) ExtraVarProof [FINISHED, 0 ms]
2.98/1.63	(2) BOUNDS(INF, INF)
2.98/1.63	
2.98/1.63	
2.98/1.63	----------------------------------------
2.98/1.63	
2.98/1.63	(0)
2.98/1.63	Obligation:
2.98/1.63	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.98/1.63	
2.98/1.63	
2.98/1.63	The TRS R consists of the following rules:
2.98/1.63	
2.98/1.63	   sel(s(X), cons(Y)) -> sel(X, Z)
2.98/1.63	   sel1(s(X), cons(Y)) -> sel1(X, Z)
2.98/1.63	   first1(s(X), cons(Y)) -> cons1(quote, first1(X, Z))
2.98/1.63	   quote -> sel1(X, Z)
2.98/1.63	   quote1 -> first1(X, Z)
2.98/1.63	   sel(0, cons(X)) -> X
2.98/1.63	   first(0, Z) -> nil
2.98/1.63	   first(s(X), cons(Y)) -> cons(Y)
2.98/1.63	   from(X) -> cons(X)
2.98/1.63	   sel1(0, cons(X)) -> quote
2.98/1.63	   first1(0, Z) -> nil1
2.98/1.63	   quote -> 01
2.98/1.63	   quote1 -> cons1(quote, quote1)
2.98/1.63	   quote1 -> nil1
2.98/1.63	   quote -> s1(quote)
2.98/1.63	   unquote(01) -> 0
2.98/1.63	   unquote(s1(X)) -> s(unquote(X))
2.98/1.63	   unquote1(nil1) -> nil
2.98/1.63	   unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
2.98/1.63	   fcons(X, Z) -> cons(X)
2.98/1.63	
2.98/1.63	
2.98/1.63	----------------------------------------
2.98/1.63	
2.98/1.63	(1) ExtraVarProof (FINISHED)
2.98/1.63	unbounded runtime complexity due to extra variable on rhs
2.98/1.63	----------------------------------------
2.98/1.63	
2.98/1.63	(2)
2.98/1.63	BOUNDS(INF, INF)
3.31/2.06	EOF