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