MAYBE
846.92/297.02	MAYBE
846.92/297.02	
846.92/297.02	We are left with following problem, upon which TcT provides the
846.92/297.02	certificate MAYBE.
846.92/297.02	
846.92/297.02	Strict Trs:
846.92/297.02	  { natsFrom(N) -> cons(N, n__natsFrom(n__s(N)))
846.92/297.02	  , natsFrom(X) -> n__natsFrom(X)
846.92/297.02	  , fst(pair(XS, YS)) -> XS
846.92/297.02	  , snd(pair(XS, YS)) -> YS
846.92/297.02	  , splitAt(0(), XS) -> pair(nil(), XS)
846.92/297.02	  , splitAt(s(N), cons(X, XS)) ->
846.92/297.02	    u(splitAt(N, activate(XS)), N, X, activate(XS))
846.92/297.02	  , s(X) -> n__s(X)
846.92/297.02	  , u(pair(YS, ZS), N, X, XS) -> pair(cons(activate(X), YS), ZS)
846.92/297.02	  , activate(X) -> X
846.92/297.02	  , activate(n__natsFrom(X)) -> natsFrom(activate(X))
846.92/297.02	  , activate(n__s(X)) -> s(activate(X))
846.92/297.02	  , head(cons(N, XS)) -> N
846.92/297.02	  , tail(cons(N, XS)) -> activate(XS)
846.92/297.02	  , sel(N, XS) -> head(afterNth(N, XS))
846.92/297.02	  , afterNth(N, XS) -> snd(splitAt(N, XS))
846.92/297.02	  , take(N, XS) -> fst(splitAt(N, XS)) }
846.92/297.02	Obligation:
846.92/297.02	  runtime complexity
846.92/297.02	Answer:
846.92/297.02	  MAYBE
846.92/297.02	
846.92/297.02	None of the processors succeeded.
846.92/297.02	
846.92/297.02	Details of failed attempt(s):
846.92/297.02	-----------------------------
846.92/297.02	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
846.92/297.02	   following reason:
846.92/297.02	   
846.92/297.02	   Computation stopped due to timeout after 297.0 seconds.
846.92/297.02	
846.92/297.02	2) 'Best' failed due to the following reason:
846.92/297.02	   
846.92/297.02	   None of the processors succeeded.
846.92/297.02	   
846.92/297.02	   Details of failed attempt(s):
846.92/297.02	   -----------------------------
846.92/297.02	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
846.92/297.02	      seconds)' failed due to the following reason:
846.92/297.02	      
846.92/297.02	      Computation stopped due to timeout after 148.0 seconds.
846.92/297.02	   
846.92/297.02	   2) 'Best' failed due to the following reason:
846.92/297.02	      
846.92/297.02	      None of the processors succeeded.
846.92/297.02	      
846.92/297.02	      Details of failed attempt(s):
846.92/297.02	      -----------------------------
846.92/297.02	      1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
846.92/297.02	         following reason:
846.92/297.02	         
846.92/297.02	         The processor is inapplicable, reason:
846.92/297.02	           Processor only applicable for innermost runtime complexity analysis
846.92/297.02	      
846.92/297.02	      2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
846.92/297.02	         to the following reason:
846.92/297.02	         
846.92/297.02	         The processor is inapplicable, reason:
846.92/297.02	           Processor only applicable for innermost runtime complexity analysis
846.92/297.02	      
846.92/297.02	   
846.92/297.02	   3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
846.92/297.02	      failed due to the following reason:
846.92/297.02	      
846.92/297.02	      None of the processors succeeded.
846.92/297.02	      
846.92/297.02	      Details of failed attempt(s):
846.92/297.02	      -----------------------------
846.92/297.02	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
846.92/297.02	         failed due to the following reason:
846.92/297.02	         
846.92/297.02	         match-boundness of the problem could not be verified.
846.92/297.02	      
846.92/297.02	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
846.92/297.02	         failed due to the following reason:
846.92/297.02	         
846.92/297.02	         match-boundness of the problem could not be verified.
846.92/297.02	      
846.92/297.02	   
846.92/297.02	
846.92/297.02	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
846.92/297.02	   the following reason:
846.92/297.02	   
846.92/297.02	   We add the following weak dependency pairs:
846.92/297.02	   
846.92/297.02	   Strict DPs:
846.92/297.02	     { natsFrom^#(N) -> c_1(N, N)
846.92/297.02	     , natsFrom^#(X) -> c_2(X)
846.92/297.02	     , fst^#(pair(XS, YS)) -> c_3(XS)
846.92/297.02	     , snd^#(pair(XS, YS)) -> c_4(YS)
846.92/297.02	     , splitAt^#(0(), XS) -> c_5(XS)
846.92/297.02	     , splitAt^#(s(N), cons(X, XS)) ->
846.92/297.02	       c_6(u^#(splitAt(N, activate(XS)), N, X, activate(XS)))
846.92/297.02	     , u^#(pair(YS, ZS), N, X, XS) -> c_8(activate^#(X), YS, ZS)
846.92/297.02	     , s^#(X) -> c_7(X)
846.92/297.02	     , activate^#(X) -> c_9(X)
846.92/297.02	     , activate^#(n__natsFrom(X)) -> c_10(natsFrom^#(activate(X)))
846.92/297.02	     , activate^#(n__s(X)) -> c_11(s^#(activate(X)))
846.92/297.02	     , head^#(cons(N, XS)) -> c_12(N)
846.92/297.02	     , tail^#(cons(N, XS)) -> c_13(activate^#(XS))
846.92/297.02	     , sel^#(N, XS) -> c_14(head^#(afterNth(N, XS)))
846.92/297.02	     , afterNth^#(N, XS) -> c_15(snd^#(splitAt(N, XS)))
846.92/297.02	     , take^#(N, XS) -> c_16(fst^#(splitAt(N, XS))) }
846.92/297.02	   
846.92/297.02	   and mark the set of starting terms.
846.92/297.02	   
846.92/297.02	   We are left with following problem, upon which TcT provides the
846.92/297.02	   certificate MAYBE.
846.92/297.02	   
846.92/297.02	   Strict DPs:
846.92/297.02	     { natsFrom^#(N) -> c_1(N, N)
846.92/297.02	     , natsFrom^#(X) -> c_2(X)
846.92/297.02	     , fst^#(pair(XS, YS)) -> c_3(XS)
846.92/297.02	     , snd^#(pair(XS, YS)) -> c_4(YS)
846.92/297.02	     , splitAt^#(0(), XS) -> c_5(XS)
846.92/297.02	     , splitAt^#(s(N), cons(X, XS)) ->
846.92/297.02	       c_6(u^#(splitAt(N, activate(XS)), N, X, activate(XS)))
846.92/297.02	     , u^#(pair(YS, ZS), N, X, XS) -> c_8(activate^#(X), YS, ZS)
846.92/297.02	     , s^#(X) -> c_7(X)
846.92/297.02	     , activate^#(X) -> c_9(X)
846.92/297.02	     , activate^#(n__natsFrom(X)) -> c_10(natsFrom^#(activate(X)))
846.92/297.02	     , activate^#(n__s(X)) -> c_11(s^#(activate(X)))
846.92/297.02	     , head^#(cons(N, XS)) -> c_12(N)
846.92/297.02	     , tail^#(cons(N, XS)) -> c_13(activate^#(XS))
846.92/297.02	     , sel^#(N, XS) -> c_14(head^#(afterNth(N, XS)))
846.92/297.02	     , afterNth^#(N, XS) -> c_15(snd^#(splitAt(N, XS)))
846.92/297.02	     , take^#(N, XS) -> c_16(fst^#(splitAt(N, XS))) }
846.92/297.02	   Strict Trs:
846.92/297.02	     { natsFrom(N) -> cons(N, n__natsFrom(n__s(N)))
846.92/297.02	     , natsFrom(X) -> n__natsFrom(X)
846.92/297.02	     , fst(pair(XS, YS)) -> XS
846.92/297.02	     , snd(pair(XS, YS)) -> YS
846.92/297.02	     , splitAt(0(), XS) -> pair(nil(), XS)
846.92/297.02	     , splitAt(s(N), cons(X, XS)) ->
846.92/297.02	       u(splitAt(N, activate(XS)), N, X, activate(XS))
846.92/297.02	     , s(X) -> n__s(X)
846.92/297.02	     , u(pair(YS, ZS), N, X, XS) -> pair(cons(activate(X), YS), ZS)
846.92/297.02	     , activate(X) -> X
846.92/297.02	     , activate(n__natsFrom(X)) -> natsFrom(activate(X))
846.92/297.02	     , activate(n__s(X)) -> s(activate(X))
846.92/297.02	     , head(cons(N, XS)) -> N
846.92/297.02	     , tail(cons(N, XS)) -> activate(XS)
846.92/297.02	     , sel(N, XS) -> head(afterNth(N, XS))
846.92/297.02	     , afterNth(N, XS) -> snd(splitAt(N, XS))
846.92/297.02	     , take(N, XS) -> fst(splitAt(N, XS)) }
846.92/297.02	   Obligation:
846.92/297.02	     runtime complexity
846.92/297.02	   Answer:
846.92/297.02	     MAYBE
846.92/297.02	   
846.92/297.02	   Empty strict component of the problem is NOT empty.
846.92/297.02	
846.92/297.02	
846.92/297.02	Arrrr..
847.25/297.37	EOF