MAYBE
811.92/297.04	MAYBE
811.92/297.04	
811.92/297.04	We are left with following problem, upon which TcT provides the
811.92/297.04	certificate MAYBE.
811.92/297.04	
811.92/297.04	Strict Trs:
811.92/297.04	  { min(x, 0()) -> 0()
811.92/297.04	  , min(0(), y) -> 0()
811.92/297.04	  , min(s(x), s(y)) -> s(min(x, y))
811.92/297.04	  , max(x, 0()) -> x
811.92/297.04	  , max(0(), y) -> y
811.92/297.04	  , max(s(x), s(y)) -> s(max(x, y))
811.92/297.04	  , minus(x, 0()) -> x
811.92/297.04	  , minus(s(x), s(y)) -> s(minus(x, y))
811.92/297.04	  , gcd(s(x), s(y)) ->
811.92/297.04	    gcd(minus(max(x, y), min(x, transform(y))), s(min(x, y)))
811.92/297.04	  , transform(x) -> s(s(x))
811.92/297.04	  , transform(s(x)) -> s(s(transform(x)))
811.92/297.04	  , transform(cons(x, y)) -> y
811.92/297.04	  , transform(cons(x, y)) -> cons(cons(x, x), x)
811.92/297.04	  , cons(x, y) -> y
811.92/297.04	  , cons(x, cons(y, s(z))) -> cons(y, x)
811.92/297.04	  , cons(cons(x, z), s(y)) -> transform(x) }
811.92/297.04	Obligation:
811.92/297.04	  runtime complexity
811.92/297.04	Answer:
811.92/297.04	  MAYBE
811.92/297.04	
811.92/297.04	None of the processors succeeded.
811.92/297.04	
811.92/297.04	Details of failed attempt(s):
811.92/297.04	-----------------------------
811.92/297.04	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
811.92/297.04	   following reason:
811.92/297.04	   
811.92/297.04	   Computation stopped due to timeout after 297.0 seconds.
811.92/297.04	
811.92/297.04	2) 'Best' failed due to the following reason:
811.92/297.04	   
811.92/297.04	   None of the processors succeeded.
811.92/297.04	   
811.92/297.04	   Details of failed attempt(s):
811.92/297.04	   -----------------------------
811.92/297.04	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
811.92/297.04	      seconds)' failed due to the following reason:
811.92/297.04	      
811.92/297.04	      Computation stopped due to timeout after 148.0 seconds.
811.92/297.04	   
811.92/297.04	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
811.92/297.04	      failed due to the following reason:
811.92/297.04	      
811.92/297.04	      None of the processors succeeded.
811.92/297.04	      
811.92/297.04	      Details of failed attempt(s):
811.92/297.04	      -----------------------------
811.92/297.04	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
811.92/297.04	         failed due to the following reason:
811.92/297.04	         
811.92/297.04	         match-boundness of the problem could not be verified.
811.92/297.04	      
811.92/297.04	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
811.92/297.04	         failed due to the following reason:
811.92/297.04	         
811.92/297.04	         match-boundness of the problem could not be verified.
811.92/297.04	      
811.92/297.04	   
811.92/297.04	   3) 'Best' failed due to the following reason:
811.92/297.04	      
811.92/297.04	      None of the processors succeeded.
811.92/297.04	      
811.92/297.04	      Details of failed attempt(s):
811.92/297.04	      -----------------------------
811.92/297.04	      1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
811.92/297.04	         to the following reason:
811.92/297.04	         
811.92/297.04	         The processor is inapplicable, reason:
811.92/297.04	           Processor only applicable for innermost runtime complexity analysis
811.92/297.04	      
811.92/297.04	      2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
811.92/297.04	         following reason:
811.92/297.04	         
811.92/297.04	         The processor is inapplicable, reason:
811.92/297.04	           Processor only applicable for innermost runtime complexity analysis
811.92/297.04	      
811.92/297.04	   
811.92/297.04	
811.92/297.04	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
811.92/297.04	   the following reason:
811.92/297.04	   
811.92/297.04	   We add the following weak dependency pairs:
811.92/297.04	   
811.92/297.04	   Strict DPs:
811.92/297.04	     { min^#(x, 0()) -> c_1()
811.92/297.04	     , min^#(0(), y) -> c_2()
811.92/297.04	     , min^#(s(x), s(y)) -> c_3(min^#(x, y))
811.92/297.04	     , max^#(x, 0()) -> c_4(x)
811.92/297.04	     , max^#(0(), y) -> c_5(y)
811.92/297.04	     , max^#(s(x), s(y)) -> c_6(max^#(x, y))
811.92/297.04	     , minus^#(x, 0()) -> c_7(x)
811.92/297.04	     , minus^#(s(x), s(y)) -> c_8(minus^#(x, y))
811.92/297.04	     , gcd^#(s(x), s(y)) ->
811.92/297.04	       c_9(gcd^#(minus(max(x, y), min(x, transform(y))), s(min(x, y))))
811.92/297.04	     , transform^#(x) -> c_10(x)
811.92/297.04	     , transform^#(s(x)) -> c_11(transform^#(x))
811.92/297.04	     , transform^#(cons(x, y)) -> c_12(y)
811.92/297.04	     , transform^#(cons(x, y)) -> c_13(cons^#(cons(x, x), x))
811.92/297.04	     , cons^#(x, y) -> c_14(y)
811.92/297.04	     , cons^#(x, cons(y, s(z))) -> c_15(cons^#(y, x))
811.92/297.04	     , cons^#(cons(x, z), s(y)) -> c_16(transform^#(x)) }
811.92/297.04	   
811.92/297.04	   and mark the set of starting terms.
811.92/297.04	   
811.92/297.04	   We are left with following problem, upon which TcT provides the
811.92/297.04	   certificate MAYBE.
811.92/297.04	   
811.92/297.04	   Strict DPs:
811.92/297.04	     { min^#(x, 0()) -> c_1()
811.92/297.04	     , min^#(0(), y) -> c_2()
811.92/297.04	     , min^#(s(x), s(y)) -> c_3(min^#(x, y))
811.92/297.04	     , max^#(x, 0()) -> c_4(x)
811.92/297.04	     , max^#(0(), y) -> c_5(y)
811.92/297.04	     , max^#(s(x), s(y)) -> c_6(max^#(x, y))
811.92/297.04	     , minus^#(x, 0()) -> c_7(x)
811.92/297.04	     , minus^#(s(x), s(y)) -> c_8(minus^#(x, y))
811.92/297.04	     , gcd^#(s(x), s(y)) ->
811.92/297.04	       c_9(gcd^#(minus(max(x, y), min(x, transform(y))), s(min(x, y))))
811.92/297.04	     , transform^#(x) -> c_10(x)
811.92/297.04	     , transform^#(s(x)) -> c_11(transform^#(x))
811.92/297.04	     , transform^#(cons(x, y)) -> c_12(y)
811.92/297.04	     , transform^#(cons(x, y)) -> c_13(cons^#(cons(x, x), x))
811.92/297.04	     , cons^#(x, y) -> c_14(y)
811.92/297.04	     , cons^#(x, cons(y, s(z))) -> c_15(cons^#(y, x))
811.92/297.04	     , cons^#(cons(x, z), s(y)) -> c_16(transform^#(x)) }
811.92/297.04	   Strict Trs:
811.92/297.04	     { min(x, 0()) -> 0()
811.92/297.04	     , min(0(), y) -> 0()
811.92/297.04	     , min(s(x), s(y)) -> s(min(x, y))
811.92/297.04	     , max(x, 0()) -> x
811.92/297.04	     , max(0(), y) -> y
811.92/297.04	     , max(s(x), s(y)) -> s(max(x, y))
811.92/297.04	     , minus(x, 0()) -> x
811.92/297.04	     , minus(s(x), s(y)) -> s(minus(x, y))
811.92/297.04	     , gcd(s(x), s(y)) ->
811.92/297.04	       gcd(minus(max(x, y), min(x, transform(y))), s(min(x, y)))
811.92/297.04	     , transform(x) -> s(s(x))
811.92/297.04	     , transform(s(x)) -> s(s(transform(x)))
811.92/297.04	     , transform(cons(x, y)) -> y
811.92/297.04	     , transform(cons(x, y)) -> cons(cons(x, x), x)
811.92/297.04	     , cons(x, y) -> y
811.92/297.04	     , cons(x, cons(y, s(z))) -> cons(y, x)
811.92/297.04	     , cons(cons(x, z), s(y)) -> transform(x) }
811.92/297.04	   Obligation:
811.92/297.04	     runtime complexity
811.92/297.04	   Answer:
811.92/297.04	     MAYBE
811.92/297.04	   
811.92/297.04	   We estimate the number of application of {1,2} by applications of
811.92/297.04	   Pre({1,2}) = {3,4,5,7,10,12,14}. Here rules are labeled as follows:
811.92/297.04	   
811.92/297.04	     DPs:
811.92/297.04	       { 1: min^#(x, 0()) -> c_1()
811.92/297.04	       , 2: min^#(0(), y) -> c_2()
811.92/297.04	       , 3: min^#(s(x), s(y)) -> c_3(min^#(x, y))
811.92/297.04	       , 4: max^#(x, 0()) -> c_4(x)
811.92/297.04	       , 5: max^#(0(), y) -> c_5(y)
811.92/297.04	       , 6: max^#(s(x), s(y)) -> c_6(max^#(x, y))
811.92/297.04	       , 7: minus^#(x, 0()) -> c_7(x)
811.92/297.04	       , 8: minus^#(s(x), s(y)) -> c_8(minus^#(x, y))
811.92/297.04	       , 9: gcd^#(s(x), s(y)) ->
811.92/297.04	            c_9(gcd^#(minus(max(x, y), min(x, transform(y))), s(min(x, y))))
811.92/297.04	       , 10: transform^#(x) -> c_10(x)
811.92/297.04	       , 11: transform^#(s(x)) -> c_11(transform^#(x))
811.92/297.04	       , 12: transform^#(cons(x, y)) -> c_12(y)
811.92/297.04	       , 13: transform^#(cons(x, y)) -> c_13(cons^#(cons(x, x), x))
811.92/297.04	       , 14: cons^#(x, y) -> c_14(y)
811.92/297.04	       , 15: cons^#(x, cons(y, s(z))) -> c_15(cons^#(y, x))
811.92/297.04	       , 16: cons^#(cons(x, z), s(y)) -> c_16(transform^#(x)) }
811.92/297.04	   
811.92/297.04	   We are left with following problem, upon which TcT provides the
811.92/297.04	   certificate MAYBE.
811.92/297.04	   
811.92/297.04	   Strict DPs:
811.92/297.04	     { min^#(s(x), s(y)) -> c_3(min^#(x, y))
811.92/297.04	     , max^#(x, 0()) -> c_4(x)
811.92/297.04	     , max^#(0(), y) -> c_5(y)
811.92/297.04	     , max^#(s(x), s(y)) -> c_6(max^#(x, y))
811.92/297.04	     , minus^#(x, 0()) -> c_7(x)
811.92/297.04	     , minus^#(s(x), s(y)) -> c_8(minus^#(x, y))
811.92/297.04	     , gcd^#(s(x), s(y)) ->
811.92/297.04	       c_9(gcd^#(minus(max(x, y), min(x, transform(y))), s(min(x, y))))
811.92/297.04	     , transform^#(x) -> c_10(x)
811.92/297.04	     , transform^#(s(x)) -> c_11(transform^#(x))
811.92/297.04	     , transform^#(cons(x, y)) -> c_12(y)
811.92/297.04	     , transform^#(cons(x, y)) -> c_13(cons^#(cons(x, x), x))
811.92/297.04	     , cons^#(x, y) -> c_14(y)
811.92/297.04	     , cons^#(x, cons(y, s(z))) -> c_15(cons^#(y, x))
811.92/297.04	     , cons^#(cons(x, z), s(y)) -> c_16(transform^#(x)) }
811.92/297.04	   Strict Trs:
811.92/297.04	     { min(x, 0()) -> 0()
811.92/297.04	     , min(0(), y) -> 0()
811.92/297.04	     , min(s(x), s(y)) -> s(min(x, y))
811.92/297.04	     , max(x, 0()) -> x
811.92/297.04	     , max(0(), y) -> y
811.92/297.04	     , max(s(x), s(y)) -> s(max(x, y))
811.92/297.04	     , minus(x, 0()) -> x
811.92/297.04	     , minus(s(x), s(y)) -> s(minus(x, y))
811.92/297.04	     , gcd(s(x), s(y)) ->
811.92/297.04	       gcd(minus(max(x, y), min(x, transform(y))), s(min(x, y)))
811.92/297.04	     , transform(x) -> s(s(x))
811.92/297.04	     , transform(s(x)) -> s(s(transform(x)))
811.92/297.04	     , transform(cons(x, y)) -> y
811.92/297.04	     , transform(cons(x, y)) -> cons(cons(x, x), x)
811.92/297.04	     , cons(x, y) -> y
811.92/297.04	     , cons(x, cons(y, s(z))) -> cons(y, x)
811.92/297.04	     , cons(cons(x, z), s(y)) -> transform(x) }
811.92/297.04	   Weak DPs:
811.92/297.04	     { min^#(x, 0()) -> c_1()
811.92/297.04	     , min^#(0(), y) -> c_2() }
811.92/297.04	   Obligation:
811.92/297.04	     runtime complexity
811.92/297.04	   Answer:
811.92/297.04	     MAYBE
811.92/297.04	   
811.92/297.04	   Empty strict component of the problem is NOT empty.
811.92/297.04	
811.92/297.04	
811.92/297.04	Arrrr..
812.14/297.24	EOF