MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            and(x,or(y,z)) -> or(and(x,y),and(x,z))
            and(or(y,z),x) -> or(and(x,y),and(x,z))
            not(and(x,y)) -> or(not(x),not(y))
            not(not(x)) -> x
            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))
          and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
          not#(and(x,y)) -> c_3(not#(x),not#(y))
          not#(not(x)) -> c_4()
          not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
            and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
            not#(and(x,y)) -> c_3(not#(x),not#(y))
            not#(not(x)) -> c_4()
            not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
        - Weak TRS:
            and(x,or(y,z)) -> or(and(x,y),and(x,z))
            and(or(y,z),x) -> or(and(x,y),and(x,z))
            not(and(x,y)) -> or(not(x),not(y))
            not(not(x)) -> x
            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/2,c_4/0,c_5/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and#,not#} and constructors {or}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {4}
        by application of
          Pre({4}) = {3,5}.
        Here rules are labelled as follows:
          1: and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
          2: and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
          3: not#(and(x,y)) -> c_3(not#(x),not#(y))
          4: not#(not(x)) -> c_4()
          5: not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
* Step 3: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
            and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
            not#(and(x,y)) -> c_3(not#(x),not#(y))
            not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
        - Weak DPs:
            not#(not(x)) -> c_4()
        - Weak TRS:
            and(x,or(y,z)) -> or(and(x,y),and(x,z))
            and(or(y,z),x) -> or(and(x,y),and(x,z))
            not(and(x,y)) -> or(not(x),not(y))
            not(not(x)) -> x
            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/2,c_4/0,c_5/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and#,not#} and constructors {or}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
             -->_2 and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z)):2
             -->_1 and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z)):2
             -->_2 and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z)):1
             -->_1 and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z)):1
          
          2:S:and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
             -->_2 and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z)):2
             -->_1 and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z)):2
             -->_2 and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z)):1
             -->_1 and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z)):1
          
          3:S:not#(and(x,y)) -> c_3(not#(x),not#(y))
             -->_2 not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y)):4
             -->_1 not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y)):4
             -->_2 not#(not(x)) -> c_4():5
             -->_1 not#(not(x)) -> c_4():5
             -->_2 not#(and(x,y)) -> c_3(not#(x),not#(y)):3
             -->_1 not#(and(x,y)) -> c_3(not#(x),not#(y)):3
          
          4:S:not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
             -->_3 not#(not(x)) -> c_4():5
             -->_2 not#(not(x)) -> c_4():5
             -->_3 not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y)):4
             -->_2 not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y)):4
             -->_3 not#(and(x,y)) -> c_3(not#(x),not#(y)):3
             -->_2 not#(and(x,y)) -> c_3(not#(x),not#(y)):3
             -->_1 and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z)):2
             -->_1 and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z)):1
          
          5:W:not#(not(x)) -> c_4()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          5: not#(not(x)) -> c_4()
* Step 4: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          and#(x,or(y,z)) -> c_1(and#(x,y),and#(x,z))
          and#(or(y,z),x) -> c_2(and#(x,y),and#(x,z))
          not#(and(x,y)) -> c_3(not#(x),not#(y))
          not#(or(x,y)) -> c_5(and#(not(x),not(y)),not#(x),not#(y))
      - Weak TRS:
          and(x,or(y,z)) -> or(and(x,y),and(x,z))
          and(or(y,z),x) -> or(and(x,y),and(x,z))
          not(and(x,y)) -> or(not(x),not(y))
          not(not(x)) -> x
          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/2,c_4/0,c_5/3}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {and#,not#} and constructors {or}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE