MAYBE
597.90/210.95	MAYBE
597.90/210.95	
597.90/210.95	We are left with following problem, upon which TcT provides the
597.90/210.95	certificate MAYBE.
597.90/210.95	
597.90/210.95	Strict Trs:
597.90/210.95	  { nthtail(n, l) -> cond(ge(n, length(l)), n, l)
597.90/210.95	  , cond(true(), n, l) -> l
597.90/210.95	  , cond(false(), n, l) -> tail(nthtail(s(n), l))
597.90/210.95	  , ge(u, 0()) -> true()
597.90/210.95	  , ge(s(u), s(v)) -> ge(u, v)
597.90/210.95	  , ge(0(), s(v)) -> false()
597.90/210.95	  , length(nil()) -> 0()
597.90/210.95	  , length(cons(x, l)) -> s(length(l))
597.90/210.95	  , tail(nil()) -> nil()
597.90/210.95	  , tail(cons(x, l)) -> l }
597.90/210.95	Obligation:
597.90/210.95	  runtime complexity
597.90/210.95	Answer:
597.90/210.95	  MAYBE
597.90/210.95	
597.90/210.95	None of the processors succeeded.
597.90/210.95	
597.90/210.95	Details of failed attempt(s):
597.90/210.95	-----------------------------
597.90/210.95	1) 'Best' failed due to the following reason:
597.90/210.95	   
597.90/210.95	   None of the processors succeeded.
597.90/210.95	   
597.90/210.95	   Details of failed attempt(s):
597.90/210.95	   -----------------------------
597.90/210.95	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
597.90/210.95	      seconds)' failed due to the following reason:
597.90/210.95	      
597.90/210.95	      Computation stopped due to timeout after 148.0 seconds.
597.90/210.95	   
597.90/210.95	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
597.90/210.95	      failed due to the following reason:
597.90/210.95	      
597.90/210.95	      None of the processors succeeded.
597.90/210.95	      
597.90/210.95	      Details of failed attempt(s):
597.90/210.95	      -----------------------------
597.90/210.95	      1) 'Bounds with perSymbol-enrichment and initial automaton 'match''
597.90/210.95	         failed due to the following reason:
597.90/210.95	         
597.90/210.95	         match-boundness of the problem could not be verified.
597.90/210.95	      
597.90/210.95	      2) 'Bounds with minimal-enrichment and initial automaton 'match''
597.90/210.95	         failed due to the following reason:
597.90/210.95	         
597.90/210.95	         match-boundness of the problem could not be verified.
597.90/210.95	      
597.90/210.95	   
597.90/210.95	   3) 'Best' failed due to the following reason:
597.90/210.95	      
597.90/210.95	      None of the processors succeeded.
597.90/210.95	      
597.90/210.95	      Details of failed attempt(s):
597.90/210.95	      -----------------------------
597.90/210.95	      1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
597.90/210.95	         to the following reason:
597.90/210.95	         
597.90/210.95	         The processor is inapplicable, reason:
597.90/210.95	           Processor only applicable for innermost runtime complexity analysis
597.90/210.95	      
597.90/210.95	      2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
597.90/210.96	         following reason:
597.90/210.96	         
597.90/210.96	         The processor is inapplicable, reason:
597.90/210.96	           Processor only applicable for innermost runtime complexity analysis
597.90/210.96	      
597.90/210.96	   
597.90/210.96	
597.90/210.96	2) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
597.90/210.96	   the following reason:
597.90/210.96	   
597.90/210.96	   We add the following weak dependency pairs:
597.90/210.96	   
597.90/210.96	   Strict DPs:
597.90/210.96	     { nthtail^#(n, l) -> c_1(cond^#(ge(n, length(l)), n, l))
597.90/210.96	     , cond^#(true(), n, l) -> c_2(l)
597.90/210.96	     , cond^#(false(), n, l) -> c_3(tail^#(nthtail(s(n), l)))
597.90/210.96	     , tail^#(nil()) -> c_9()
597.90/210.96	     , tail^#(cons(x, l)) -> c_10(l)
597.90/210.96	     , ge^#(u, 0()) -> c_4()
597.90/210.96	     , ge^#(s(u), s(v)) -> c_5(ge^#(u, v))
597.90/210.96	     , ge^#(0(), s(v)) -> c_6()
597.90/210.96	     , length^#(nil()) -> c_7()
597.90/210.96	     , length^#(cons(x, l)) -> c_8(length^#(l)) }
597.90/210.96	   
597.90/210.96	   and mark the set of starting terms.
597.90/210.96	   
597.90/210.96	   We are left with following problem, upon which TcT provides the
597.90/210.96	   certificate MAYBE.
597.90/210.96	   
597.90/210.96	   Strict DPs:
597.90/210.96	     { nthtail^#(n, l) -> c_1(cond^#(ge(n, length(l)), n, l))
597.90/210.96	     , cond^#(true(), n, l) -> c_2(l)
597.90/210.96	     , cond^#(false(), n, l) -> c_3(tail^#(nthtail(s(n), l)))
597.90/210.96	     , tail^#(nil()) -> c_9()
597.90/210.96	     , tail^#(cons(x, l)) -> c_10(l)
597.90/210.96	     , ge^#(u, 0()) -> c_4()
597.90/210.96	     , ge^#(s(u), s(v)) -> c_5(ge^#(u, v))
597.90/210.96	     , ge^#(0(), s(v)) -> c_6()
597.90/210.96	     , length^#(nil()) -> c_7()
597.90/210.96	     , length^#(cons(x, l)) -> c_8(length^#(l)) }
597.90/210.96	   Strict Trs:
597.90/210.96	     { nthtail(n, l) -> cond(ge(n, length(l)), n, l)
597.90/210.96	     , cond(true(), n, l) -> l
597.90/210.96	     , cond(false(), n, l) -> tail(nthtail(s(n), l))
597.90/210.96	     , ge(u, 0()) -> true()
597.90/210.96	     , ge(s(u), s(v)) -> ge(u, v)
597.90/210.96	     , ge(0(), s(v)) -> false()
597.90/210.96	     , length(nil()) -> 0()
597.90/210.96	     , length(cons(x, l)) -> s(length(l))
597.90/210.96	     , tail(nil()) -> nil()
597.90/210.96	     , tail(cons(x, l)) -> l }
597.90/210.96	   Obligation:
597.90/210.96	     runtime complexity
597.90/210.96	   Answer:
597.90/210.96	     MAYBE
597.90/210.96	   
597.90/210.96	   We estimate the number of application of {4,6,8,9} by applications
597.90/210.96	   of Pre({4,6,8,9}) = {2,3,5,7,10}. Here rules are labeled as
597.90/210.96	   follows:
597.90/210.96	   
597.90/210.96	     DPs:
597.90/210.96	       { 1: nthtail^#(n, l) -> c_1(cond^#(ge(n, length(l)), n, l))
597.90/210.96	       , 2: cond^#(true(), n, l) -> c_2(l)
597.90/210.96	       , 3: cond^#(false(), n, l) -> c_3(tail^#(nthtail(s(n), l)))
597.90/210.96	       , 4: tail^#(nil()) -> c_9()
597.90/210.96	       , 5: tail^#(cons(x, l)) -> c_10(l)
597.90/210.96	       , 6: ge^#(u, 0()) -> c_4()
597.90/210.96	       , 7: ge^#(s(u), s(v)) -> c_5(ge^#(u, v))
597.90/210.96	       , 8: ge^#(0(), s(v)) -> c_6()
597.90/210.96	       , 9: length^#(nil()) -> c_7()
597.90/210.96	       , 10: length^#(cons(x, l)) -> c_8(length^#(l)) }
597.90/210.96	   
597.90/210.96	   We are left with following problem, upon which TcT provides the
597.90/210.96	   certificate MAYBE.
597.90/210.96	   
597.90/210.96	   Strict DPs:
597.90/210.96	     { nthtail^#(n, l) -> c_1(cond^#(ge(n, length(l)), n, l))
597.90/210.96	     , cond^#(true(), n, l) -> c_2(l)
597.90/210.96	     , cond^#(false(), n, l) -> c_3(tail^#(nthtail(s(n), l)))
597.90/210.96	     , tail^#(cons(x, l)) -> c_10(l)
597.90/210.96	     , ge^#(s(u), s(v)) -> c_5(ge^#(u, v))
597.90/210.96	     , length^#(cons(x, l)) -> c_8(length^#(l)) }
597.90/210.96	   Strict Trs:
597.90/210.96	     { nthtail(n, l) -> cond(ge(n, length(l)), n, l)
597.90/210.96	     , cond(true(), n, l) -> l
597.90/210.96	     , cond(false(), n, l) -> tail(nthtail(s(n), l))
597.90/210.96	     , ge(u, 0()) -> true()
597.90/210.96	     , ge(s(u), s(v)) -> ge(u, v)
597.90/210.96	     , ge(0(), s(v)) -> false()
597.90/210.96	     , length(nil()) -> 0()
597.90/210.96	     , length(cons(x, l)) -> s(length(l))
597.90/210.96	     , tail(nil()) -> nil()
597.90/210.96	     , tail(cons(x, l)) -> l }
597.90/210.96	   Weak DPs:
597.90/210.96	     { tail^#(nil()) -> c_9()
597.90/210.96	     , ge^#(u, 0()) -> c_4()
597.90/210.96	     , ge^#(0(), s(v)) -> c_6()
597.90/210.96	     , length^#(nil()) -> c_7() }
597.90/210.96	   Obligation:
597.90/210.96	     runtime complexity
597.90/210.96	   Answer:
597.90/210.96	     MAYBE
597.90/210.96	   
597.90/210.96	   Empty strict component of the problem is NOT empty.
597.90/210.96	
597.90/210.96	
597.90/210.96	Arrrr..
598.23/211.28	EOF