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