WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
        - Signature:
            {and/3} / {band/2,not/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          and :: [A(7) x A(7) x A(7)] -(3)-> A(0)
          band :: [A(0) x A(0)] -(0)-> A(11)
          not :: [A(7)] -(7)-> A(7)
        
        
        Cost-free Signatures used:
        --------------------------
          and :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          band :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          not :: [A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          band_A :: [A(0) x A(0)] -(0)-> A(1)
          not_A :: [A(1)] -(1)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
    - Signature:
        {and/3} / {band/2,not/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
Following problems could not be solved:
  - Strict TRS:
      and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
  - Signature:
      {and/3} / {band/2,not/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
WORST_CASE(?,O(n^1))