MAYBE
1026.71/297.03	MAYBE
1026.71/297.03	
1026.71/297.03	We are left with following problem, upon which TcT provides the
1026.71/297.03	certificate MAYBE.
1026.71/297.03	
1026.71/297.03	Strict Trs:
1026.71/297.03	  { f(node(s(n), xs)) -> f(addchild(select(xs), node(n, xs)))
1026.71/297.03	  , addchild(node(y, ys), node(n, xs)) ->
1026.71/297.03	    node(y, cons(node(n, xs), ys))
1026.71/297.03	  , select(cons(ap, xs)) -> ap
1026.71/297.03	  , select(cons(ap, xs)) -> select(xs) }
1026.71/297.03	Obligation:
1026.71/297.03	  runtime complexity
1026.71/297.03	Answer:
1026.71/297.03	  MAYBE
1026.71/297.03	
1026.71/297.03	None of the processors succeeded.
1026.71/297.03	
1026.71/297.03	Details of failed attempt(s):
1026.71/297.03	-----------------------------
1026.71/297.03	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1026.71/297.03	   following reason:
1026.71/297.03	   
1026.71/297.03	   Computation stopped due to timeout after 297.0 seconds.
1026.71/297.03	
1026.71/297.03	2) 'Best' failed due to the following reason:
1026.71/297.03	   
1026.71/297.03	   None of the processors succeeded.
1026.71/297.03	   
1026.71/297.03	   Details of failed attempt(s):
1026.71/297.03	   -----------------------------
1026.71/297.03	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1026.71/297.03	      seconds)' failed due to the following reason:
1026.71/297.03	      
1026.71/297.03	      Computation stopped due to timeout after 148.0 seconds.
1026.71/297.03	   
1026.71/297.03	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1026.71/297.03	      failed due to the following reason:
1026.71/297.03	      
1026.71/297.03	      None of the processors succeeded.
1026.71/297.03	      
1026.71/297.03	      Details of failed attempt(s):
1026.71/297.03	      -----------------------------
1026.71/297.03	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
1026.71/297.03	         failed due to the following reason:
1026.71/297.03	         
1026.71/297.03	         match-boundness of the problem could not be verified.
1026.71/297.03	      
1026.71/297.03	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1026.71/297.03	         failed due to the following reason:
1026.71/297.03	         
1026.71/297.03	         match-boundness of the problem could not be verified.
1026.71/297.03	      
1026.71/297.03	   
1026.71/297.03	   3) 'Best' failed due to the following reason:
1026.71/297.03	      
1026.71/297.03	      None of the processors succeeded.
1026.71/297.03	      
1026.71/297.03	      Details of failed attempt(s):
1026.71/297.03	      -----------------------------
1026.71/297.03	      1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1026.71/297.03	         following reason:
1026.71/297.03	         
1026.71/297.03	         The processor is inapplicable, reason:
1026.71/297.03	           Processor only applicable for innermost runtime complexity analysis
1026.71/297.03	      
1026.71/297.03	      2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1026.71/297.03	         to the following reason:
1026.71/297.03	         
1026.71/297.03	         The processor is inapplicable, reason:
1026.71/297.03	           Processor only applicable for innermost runtime complexity analysis
1026.71/297.03	      
1026.71/297.03	   
1026.71/297.03	
1026.71/297.03	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
1026.71/297.03	   the following reason:
1026.71/297.03	   
1026.71/297.03	   We add the following weak dependency pairs:
1026.71/297.03	   
1026.71/297.03	   Strict DPs:
1026.71/297.03	     { f^#(node(s(n), xs)) ->
1026.71/297.03	       c_1(f^#(addchild(select(xs), node(n, xs))))
1026.71/297.03	     , addchild^#(node(y, ys), node(n, xs)) -> c_2(y, n, xs, ys)
1026.71/297.03	     , select^#(cons(ap, xs)) -> c_3(ap)
1026.71/297.03	     , select^#(cons(ap, xs)) -> c_4(select^#(xs)) }
1026.71/297.03	   
1026.71/297.03	   and mark the set of starting terms.
1026.71/297.03	   
1026.71/297.03	   We are left with following problem, upon which TcT provides the
1026.71/297.03	   certificate MAYBE.
1026.71/297.03	   
1026.71/297.03	   Strict DPs:
1026.71/297.03	     { f^#(node(s(n), xs)) ->
1026.71/297.03	       c_1(f^#(addchild(select(xs), node(n, xs))))
1026.71/297.03	     , addchild^#(node(y, ys), node(n, xs)) -> c_2(y, n, xs, ys)
1026.71/297.03	     , select^#(cons(ap, xs)) -> c_3(ap)
1026.71/297.03	     , select^#(cons(ap, xs)) -> c_4(select^#(xs)) }
1026.71/297.03	   Strict Trs:
1026.71/297.03	     { f(node(s(n), xs)) -> f(addchild(select(xs), node(n, xs)))
1026.71/297.03	     , addchild(node(y, ys), node(n, xs)) ->
1026.71/297.03	       node(y, cons(node(n, xs), ys))
1026.71/297.03	     , select(cons(ap, xs)) -> ap
1026.71/297.03	     , select(cons(ap, xs)) -> select(xs) }
1026.71/297.03	   Obligation:
1026.71/297.03	     runtime complexity
1026.71/297.03	   Answer:
1026.71/297.03	     MAYBE
1026.71/297.03	   
1026.71/297.03	   Empty strict component of the problem is NOT empty.
1026.71/297.03	
1026.71/297.03	
1026.71/297.03	Arrrr..
1027.25/297.50	EOF