MAYBE
926.76/298.35	MAYBE
926.76/298.35	
926.76/298.35	We are left with following problem, upon which TcT provides the
926.76/298.35	certificate MAYBE.
926.76/298.35	
926.76/298.35	Strict Trs:
926.76/298.35	  { app(l, nil()) -> l
926.76/298.35	  , app(nil(), k) -> k
926.76/298.35	  , app(cons(x, l), k) -> cons(x, app(l, k))
926.76/298.35	  , sum(app(l, cons(x, cons(y, k)))) ->
926.76/298.35	    sum(app(l, sum(cons(x, cons(y, k)))))
926.76/298.35	  , sum(cons(x, nil())) -> cons(x, nil())
926.76/298.35	  , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))
926.76/298.35	  , sum(plus(cons(0(), x), cons(y, l))) ->
926.76/298.35	    pred(sum(cons(s(x), cons(y, l))))
926.76/298.35	  , plus(0(), y) -> y
926.76/298.35	  , plus(s(x), y) -> s(plus(x, y))
926.76/298.35	  , pred(cons(s(x), nil())) -> cons(x, nil()) }
926.76/298.35	Obligation:
926.76/298.35	  runtime complexity
926.76/298.35	Answer:
926.76/298.35	  MAYBE
926.76/298.35	
926.76/298.35	None of the processors succeeded.
926.76/298.35	
926.76/298.35	Details of failed attempt(s):
926.76/298.35	-----------------------------
926.76/298.35	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
926.76/298.35	   following reason:
926.76/298.35	   
926.76/298.35	   Computation stopped due to timeout after 297.0 seconds.
926.76/298.35	
926.76/298.35	2) 'Best' failed due to the following reason:
926.76/298.35	   
926.76/298.35	   None of the processors succeeded.
926.76/298.35	   
926.76/298.35	   Details of failed attempt(s):
926.76/298.35	   -----------------------------
926.76/298.35	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
926.76/298.35	      seconds)' failed due to the following reason:
926.76/298.35	      
926.76/298.35	      Computation stopped due to timeout after 148.0 seconds.
926.76/298.35	   
926.76/298.35	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
926.76/298.35	      failed due to the following reason:
926.76/298.35	      
926.76/298.35	      Computation stopped due to timeout after 24.0 seconds.
926.76/298.35	   
926.76/298.35	   3) 'Best' failed due to the following reason:
926.76/298.35	      
926.76/298.35	      None of the processors succeeded.
926.76/298.35	      
926.76/298.35	      Details of failed attempt(s):
926.76/298.35	      -----------------------------
926.76/298.35	      1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
926.76/298.35	         following reason:
926.76/298.35	         
926.76/298.35	         The processor is inapplicable, reason:
926.76/298.35	           Processor only applicable for innermost runtime complexity analysis
926.76/298.35	      
926.76/298.35	      2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
926.76/298.35	         to the following reason:
926.76/298.35	         
926.76/298.35	         The processor is inapplicable, reason:
926.76/298.35	           Processor only applicable for innermost runtime complexity analysis
926.76/298.35	      
926.76/298.35	   
926.76/298.35	
926.76/298.35	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
926.76/298.35	   the following reason:
926.76/298.35	   
926.76/298.35	   We add the following weak dependency pairs:
926.76/298.35	   
926.76/298.35	   Strict DPs:
926.76/298.35	     { app^#(l, nil()) -> c_1(l)
926.76/298.35	     , app^#(nil(), k) -> c_2(k)
926.76/298.35	     , app^#(cons(x, l), k) -> c_3(x, app^#(l, k))
926.76/298.35	     , sum^#(app(l, cons(x, cons(y, k)))) ->
926.76/298.35	       c_4(sum^#(app(l, sum(cons(x, cons(y, k))))))
926.76/298.35	     , sum^#(cons(x, nil())) -> c_5(x)
926.76/298.35	     , sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l)))
926.76/298.35	     , sum^#(plus(cons(0(), x), cons(y, l))) ->
926.76/298.35	       c_7(pred^#(sum(cons(s(x), cons(y, l)))))
926.76/298.35	     , pred^#(cons(s(x), nil())) -> c_10(x)
926.76/298.35	     , plus^#(0(), y) -> c_8(y)
926.76/298.35	     , plus^#(s(x), y) -> c_9(plus^#(x, y)) }
926.76/298.35	   
926.76/298.35	   and mark the set of starting terms.
926.76/298.35	   
926.76/298.35	   We are left with following problem, upon which TcT provides the
926.76/298.35	   certificate MAYBE.
926.76/298.35	   
926.76/298.35	   Strict DPs:
926.76/298.35	     { app^#(l, nil()) -> c_1(l)
926.76/298.35	     , app^#(nil(), k) -> c_2(k)
926.76/298.35	     , app^#(cons(x, l), k) -> c_3(x, app^#(l, k))
926.76/298.35	     , sum^#(app(l, cons(x, cons(y, k)))) ->
926.76/298.35	       c_4(sum^#(app(l, sum(cons(x, cons(y, k))))))
926.76/298.35	     , sum^#(cons(x, nil())) -> c_5(x)
926.76/298.35	     , sum^#(cons(x, cons(y, l))) -> c_6(sum^#(cons(plus(x, y), l)))
926.76/298.35	     , sum^#(plus(cons(0(), x), cons(y, l))) ->
926.76/298.35	       c_7(pred^#(sum(cons(s(x), cons(y, l)))))
926.76/298.35	     , pred^#(cons(s(x), nil())) -> c_10(x)
926.76/298.35	     , plus^#(0(), y) -> c_8(y)
926.76/298.35	     , plus^#(s(x), y) -> c_9(plus^#(x, y)) }
926.76/298.35	   Strict Trs:
926.76/298.35	     { app(l, nil()) -> l
926.76/298.35	     , app(nil(), k) -> k
926.76/298.35	     , app(cons(x, l), k) -> cons(x, app(l, k))
926.76/298.35	     , sum(app(l, cons(x, cons(y, k)))) ->
926.76/298.35	       sum(app(l, sum(cons(x, cons(y, k)))))
926.76/298.35	     , sum(cons(x, nil())) -> cons(x, nil())
926.76/298.35	     , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))
926.76/298.35	     , sum(plus(cons(0(), x), cons(y, l))) ->
926.76/298.35	       pred(sum(cons(s(x), cons(y, l))))
926.76/298.35	     , plus(0(), y) -> y
926.76/298.35	     , plus(s(x), y) -> s(plus(x, y))
926.76/298.35	     , pred(cons(s(x), nil())) -> cons(x, nil()) }
926.76/298.35	   Obligation:
926.76/298.35	     runtime complexity
926.76/298.35	   Answer:
926.76/298.35	     MAYBE
926.76/298.35	   
926.76/298.35	   Empty strict component of the problem is NOT empty.
926.76/298.35	
926.76/298.35	
926.76/298.35	Arrrr..
927.41/298.81	EOF