MAYBE

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

Strict Trs:
  { not(not(x)) -> x
  , not(or(x, y)) -> and(not(not(not(x))), not(not(not(y))))
  , not(and(x, y)) -> or(not(not(not(x))), not(not(not(y)))) }
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) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
      due to the following reason:
      
      Computation stopped due to timeout after 5.0 seconds.
   
   3) '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) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { not^#(not(x)) -> c_1(x)
     , not^#(or(x, y)) -> c_2(not^#(not(not(x))), not^#(not(not(y))))
     , not^#(and(x, y)) -> c_3(not^#(not(not(x))), not^#(not(not(y)))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { not^#(not(x)) -> c_1(x)
     , not^#(or(x, y)) -> c_2(not^#(not(not(x))), not^#(not(not(y))))
     , not^#(and(x, y)) -> c_3(not^#(not(not(x))), not^#(not(not(y)))) }
   Strict Trs:
     { not(not(x)) -> x
     , not(or(x, y)) -> and(not(not(not(x))), not(not(not(y))))
     , not(and(x, y)) -> or(not(not(not(x))), not(not(not(y)))) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..