MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { din(der(der(X))) -> u41(din(der(X)), X)
  , din(der(plus(X, Y))) -> u21(din(der(X)), X, Y)
  , din(der(times(X, Y))) -> u31(din(der(X)), X, Y)
  , u21(dout(DX), X, Y) -> u22(din(der(Y)), X, Y, DX)
  , u22(dout(DY), X, Y, DX) -> dout(plus(DX, DY))
  , u31(dout(DX), X, Y) -> u32(din(der(Y)), X, Y, DX)
  , u32(dout(DY), X, Y, DX) -> dout(plus(times(X, DY), times(Y, DX)))
  , u41(dout(DX), X) -> u42(din(der(DX)), X, DX)
  , u42(dout(DDX), X, DX) -> dout(DDX) }
Obligation:
  runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'WithProblem (timeout of 60 seconds)' failed due to the
   following reason:
   
   Computation stopped due to timeout after 60.0 seconds.

2) 'Best' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
      failed due to the following reason:
      
      Computation stopped due to timeout after 30.0 seconds.
   
   2) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
         following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
      due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'Bounds with perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { din^#(der(der(X))) -> c_1(u41^#(din(der(X)), X))
     , din^#(der(plus(X, Y))) -> c_2(u21^#(din(der(X)), X, Y))
     , din^#(der(times(X, Y))) -> c_3(u31^#(din(der(X)), X, Y))
     , u41^#(dout(DX), X) -> c_8(u42^#(din(der(DX)), X, DX))
     , u21^#(dout(DX), X, Y) -> c_4(u22^#(din(der(Y)), X, Y, DX))
     , u31^#(dout(DX), X, Y) -> c_6(u32^#(din(der(Y)), X, Y, DX))
     , u22^#(dout(DY), X, Y, DX) -> c_5(DX, DY)
     , u32^#(dout(DY), X, Y, DX) -> c_7(X, DY, Y, DX)
     , u42^#(dout(DDX), X, DX) -> c_9(DDX) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { din^#(der(der(X))) -> c_1(u41^#(din(der(X)), X))
     , din^#(der(plus(X, Y))) -> c_2(u21^#(din(der(X)), X, Y))
     , din^#(der(times(X, Y))) -> c_3(u31^#(din(der(X)), X, Y))
     , u41^#(dout(DX), X) -> c_8(u42^#(din(der(DX)), X, DX))
     , u21^#(dout(DX), X, Y) -> c_4(u22^#(din(der(Y)), X, Y, DX))
     , u31^#(dout(DX), X, Y) -> c_6(u32^#(din(der(Y)), X, Y, DX))
     , u22^#(dout(DY), X, Y, DX) -> c_5(DX, DY)
     , u32^#(dout(DY), X, Y, DX) -> c_7(X, DY, Y, DX)
     , u42^#(dout(DDX), X, DX) -> c_9(DDX) }
   Strict Trs:
     { din(der(der(X))) -> u41(din(der(X)), X)
     , din(der(plus(X, Y))) -> u21(din(der(X)), X, Y)
     , din(der(times(X, Y))) -> u31(din(der(X)), X, Y)
     , u21(dout(DX), X, Y) -> u22(din(der(Y)), X, Y, DX)
     , u22(dout(DY), X, Y, DX) -> dout(plus(DX, DY))
     , u31(dout(DX), X, Y) -> u32(din(der(Y)), X, Y, DX)
     , u32(dout(DY), X, Y, DX) -> dout(plus(times(X, DY), times(Y, DX)))
     , u41(dout(DX), X) -> u42(din(der(DX)), X, DX)
     , u42(dout(DDX), X, DX) -> dout(DDX) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..