MAYBE
1174.45/297.03	MAYBE
1174.45/297.03	
1174.45/297.03	We are left with following problem, upon which TcT provides the
1174.45/297.03	certificate MAYBE.
1174.45/297.03	
1174.45/297.03	Strict Trs:
1174.45/297.03	  { lcm(x, y) -> lcmIter(x, y, 0(), times(x, y))
1174.45/297.03	  , lcmIter(x, y, z, u) -> if(or(ge(0(), x), ge(z, u)), x, y, z, u)
1174.45/297.03	  , times(x, y) -> ifTimes(ge(0(), x), x, y)
1174.45/297.03	  , if(true(), x, y, z, u) -> z
1174.45/297.03	  , if(false(), x, y, z, u) -> if2(divisible(z, y), x, y, z, u)
1174.45/297.03	  , or(true(), y) -> true()
1174.45/297.03	  , or(false(), y) -> y
1174.45/297.03	  , ge(x, 0()) -> true()
1174.45/297.03	  , ge(0(), s(y)) -> false()
1174.45/297.03	  , ge(s(x), s(y)) -> ge(x, y)
1174.45/297.03	  , if2(true(), x, y, z, u) -> z
1174.45/297.03	  , if2(false(), x, y, z, u) -> lcmIter(x, y, plus(x, z), u)
1174.45/297.03	  , divisible(0(), s(y)) -> true()
1174.45/297.03	  , divisible(s(x), s(y)) -> div(s(x), s(y), s(y))
1174.45/297.03	  , plus(0(), y) -> y
1174.45/297.03	  , plus(s(x), y) -> s(plus(x, y))
1174.45/297.03	  , ifTimes(true(), x, y) -> 0()
1174.45/297.03	  , ifTimes(false(), x, y) -> plus(y, times(y, p(x)))
1174.45/297.03	  , p(0()) -> s(s(0()))
1174.45/297.03	  , p(s(x)) -> x
1174.45/297.03	  , div(x, y, 0()) -> divisible(x, y)
1174.45/297.03	  , div(0(), y, s(z)) -> false()
1174.45/297.03	  , div(s(x), y, s(z)) -> div(x, y, z)
1174.45/297.03	  , a() -> b()
1174.45/297.03	  , a() -> c() }
1174.45/297.03	Obligation:
1174.45/297.03	  innermost runtime complexity
1174.45/297.03	Answer:
1174.45/297.03	  MAYBE
1174.45/297.03	
1174.45/297.03	None of the processors succeeded.
1174.45/297.03	
1174.45/297.03	Details of failed attempt(s):
1174.45/297.03	-----------------------------
1174.45/297.03	1) 'empty' failed due to the following reason:
1174.45/297.03	   
1174.45/297.03	   Empty strict component of the problem is NOT empty.
1174.45/297.03	
1174.45/297.03	2) 'Best' failed due to the following reason:
1174.45/297.03	   
1174.45/297.03	   None of the processors succeeded.
1174.45/297.03	   
1174.45/297.03	   Details of failed attempt(s):
1174.45/297.03	   -----------------------------
1174.45/297.03	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1174.45/297.03	      following reason:
1174.45/297.03	      
1174.45/297.03	      Computation stopped due to timeout after 297.0 seconds.
1174.45/297.03	   
1174.45/297.03	   2) 'Best' failed due to the following reason:
1174.45/297.03	      
1174.45/297.03	      None of the processors succeeded.
1174.45/297.03	      
1174.45/297.03	      Details of failed attempt(s):
1174.45/297.03	      -----------------------------
1174.45/297.03	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1174.45/297.03	         seconds)' failed due to the following reason:
1174.45/297.03	         
1174.45/297.03	         Computation stopped due to timeout after 148.0 seconds.
1174.45/297.03	      
1174.45/297.03	      2) 'Best' failed due to the following reason:
1174.45/297.03	         
1174.45/297.03	         None of the processors succeeded.
1174.45/297.03	         
1174.45/297.03	         Details of failed attempt(s):
1174.45/297.03	         -----------------------------
1174.45/297.03	         1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1174.45/297.03	            to the following reason:
1174.45/297.03	            
1174.45/297.03	            The input cannot be shown compatible
1174.45/297.03	         
1174.45/297.03	         2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1174.45/297.03	            following reason:
1174.45/297.03	            
1174.45/297.03	            The input cannot be shown compatible
1174.45/297.03	         
1174.45/297.03	      
1174.45/297.03	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1174.45/297.03	         failed due to the following reason:
1174.45/297.03	         
1174.45/297.03	         None of the processors succeeded.
1174.45/297.03	         
1174.45/297.03	         Details of failed attempt(s):
1174.45/297.03	         -----------------------------
1174.45/297.03	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
1174.45/297.03	            failed due to the following reason:
1174.45/297.03	            
1174.45/297.03	            match-boundness of the problem could not be verified.
1174.45/297.03	         
1174.45/297.03	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1174.45/297.03	            failed due to the following reason:
1174.45/297.03	            
1174.45/297.03	            match-boundness of the problem could not be verified.
1174.45/297.03	         
1174.45/297.03	      
1174.45/297.03	   
1174.45/297.03	
1174.45/297.03	
1174.45/297.03	Arrrr..
1175.04/297.59	EOF