MAYBE
1011.75/297.03	MAYBE
1011.75/297.03	
1011.75/297.03	We are left with following problem, upon which TcT provides the
1011.75/297.03	certificate MAYBE.
1011.75/297.03	
1011.75/297.03	Strict Trs:
1011.75/297.03	  { le(0(), y) -> true()
1011.75/297.03	  , le(s(x), 0()) -> false()
1011.75/297.03	  , le(s(x), s(y)) -> le(x, y)
1011.75/297.03	  , app(nil(), y) -> y
1011.75/297.03	  , app(add(n, x), y) -> add(n, app(x, y))
1011.75/297.03	  , low(n, nil()) -> nil()
1011.75/297.03	  , low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
1011.75/297.03	  , if_low(true(), n, add(m, x)) -> add(m, low(n, x))
1011.75/297.03	  , if_low(false(), n, add(m, x)) -> low(n, x)
1011.75/297.03	  , high(n, nil()) -> nil()
1011.75/297.03	  , high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
1011.75/297.03	  , if_high(true(), n, add(m, x)) -> high(n, x)
1011.75/297.03	  , if_high(false(), n, add(m, x)) -> add(m, high(n, x))
1011.75/297.03	  , head(add(n, x)) -> n
1011.75/297.03	  , tail(add(n, x)) -> x
1011.75/297.03	  , isempty(nil()) -> true()
1011.75/297.03	  , isempty(add(n, x)) -> false()
1011.75/297.03	  , quicksort(x) ->
1011.75/297.03	    if_qs(isempty(x),
1011.75/297.03	          low(head(x), tail(x)),
1011.75/297.03	          head(x),
1011.75/297.03	          high(head(x), tail(x)))
1011.75/297.03	  , if_qs(true(), x, n, y) -> nil()
1011.75/297.03	  , if_qs(false(), x, n, y) ->
1011.75/297.03	    app(quicksort(x), add(n, quicksort(y))) }
1011.75/297.03	Obligation:
1011.75/297.03	  innermost runtime complexity
1011.75/297.03	Answer:
1011.75/297.03	  MAYBE
1011.75/297.03	
1011.75/297.03	None of the processors succeeded.
1011.75/297.03	
1011.75/297.03	Details of failed attempt(s):
1011.75/297.03	-----------------------------
1011.75/297.03	1) 'empty' failed due to the following reason:
1011.75/297.03	   
1011.75/297.03	   Empty strict component of the problem is NOT empty.
1011.75/297.03	
1011.75/297.03	2) 'Best' failed due to the following reason:
1011.75/297.03	   
1011.75/297.03	   None of the processors succeeded.
1011.75/297.03	   
1011.75/297.03	   Details of failed attempt(s):
1011.75/297.03	   -----------------------------
1011.75/297.03	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1011.75/297.03	      following reason:
1011.75/297.03	      
1011.75/297.03	      Computation stopped due to timeout after 297.0 seconds.
1011.75/297.03	   
1011.75/297.03	   2) 'Best' failed due to the following reason:
1011.75/297.03	      
1011.75/297.03	      None of the processors succeeded.
1011.75/297.03	      
1011.75/297.03	      Details of failed attempt(s):
1011.75/297.03	      -----------------------------
1011.75/297.03	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1011.75/297.03	         seconds)' failed due to the following reason:
1011.75/297.03	         
1011.75/297.03	         Computation stopped due to timeout after 148.0 seconds.
1011.75/297.03	      
1011.75/297.03	      2) 'Best' failed due to the following reason:
1011.75/297.03	         
1011.75/297.03	         None of the processors succeeded.
1011.75/297.03	         
1011.75/297.03	         Details of failed attempt(s):
1011.75/297.03	         -----------------------------
1011.75/297.03	         1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1011.75/297.03	            following reason:
1011.75/297.03	            
1011.75/297.03	            The input cannot be shown compatible
1011.75/297.03	         
1011.75/297.03	         2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1011.75/297.03	            to the following reason:
1011.75/297.03	            
1011.75/297.03	            The input cannot be shown compatible
1011.75/297.03	         
1011.75/297.03	      
1011.75/297.03	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1011.75/297.03	         failed due to the following reason:
1011.75/297.03	         
1011.75/297.03	         None of the processors succeeded.
1011.75/297.03	         
1011.75/297.03	         Details of failed attempt(s):
1011.75/297.03	         -----------------------------
1011.75/297.03	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
1011.75/297.03	            failed due to the following reason:
1011.75/297.03	            
1011.75/297.03	            match-boundness of the problem could not be verified.
1011.75/297.03	         
1011.75/297.03	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1011.75/297.03	            failed due to the following reason:
1011.75/297.03	            
1011.75/297.03	            match-boundness of the problem could not be verified.
1011.75/297.03	         
1011.75/297.03	      
1011.75/297.03	   
1011.75/297.03	
1011.75/297.03	
1011.75/297.03	Arrrr..
1012.20/297.40	EOF