MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            and(x,or(y,z)) -> or(and(x,y),and(x,z))
            not(and(x,y)) -> or(not(x),not(y))
            not(or(x,y)) -> and(not(x),not(y))
        - Signature:
            {and/2,not/1} / {or/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and,not} and constructors {or}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
          not#(and(x,y)) -> c_2(not#(x),not#(y))
          not#(or(x,y)) -> c_3(and#(not(x),not(y)),not#(x),not#(y))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
          not#(and(x,y)) -> c_2(not#(x),not#(y))
          not#(or(x,y)) -> c_3(and#(not(x),not(y)),not#(x),not#(y))
      - Weak TRS:
          and(x,or(y,z)) -> or(and(x,y),and(x,z))
          not(and(x,y)) -> or(not(x),not(y))
          not(or(x,y)) -> and(not(x),not(y))
      - Signature:
          {and/2,not/1,and#/2,not#/1} / {or/2,c_1/2,c_2/2,c_3/3}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {and#,not#} and constructors {or}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE