WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            -(x,0()) -> x
            -(0(),s(y)) -> 0()
            -(s(x),s(y)) -> -(x,y)
            div(x,0()) -> 0()
            div(0(),y) -> 0()
            div(s(x),s(y)) -> if(lt(x,y),0(),s(div(-(x,y),s(y))))
            if(false(),x,y) -> y
            if(true(),x,y) -> x
            lt(x,0()) -> false()
            lt(0(),s(y)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
        - Signature:
            {-/2,div/2,if/3,lt/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {-,div,if,lt} and constructors {0,false,s,true}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          - :: [A(4, 2) x A(0, 0)] -(1)-> A(4, 2)
          0 :: [] -(0)-> A(0, 0)
          0 :: [] -(0)-> A(4, 2)
          0 :: [] -(0)-> A(2, 0)
          0 :: [] -(0)-> A(6, 4)
          0 :: [] -(0)-> A(4, 4)
          0 :: [] -(0)-> A(2, 3)
          div :: [A(4, 2) x A(0, 0)] -(2)-> A(0, 0)
          false :: [] -(0)-> A(0, 0)
          false :: [] -(0)-> A(0, 2)
          if :: [A(0, 0) x A(1, 1) x A(0, 0)] -(1)-> A(0, 0)
          lt :: [A(2, 0) x A(0, 0)] -(1)-> A(0, 0)
          s :: [A(0, 0)] -(0)-> A(0, 0)
          s :: [A(6, 2)] -(4)-> A(4, 2)
          s :: [A(2, 0)] -(2)-> A(2, 0)
          true :: [] -(0)-> A(0, 0)
          true :: [] -(0)-> A(0, 1)
        
        
        Cost-free Signatures used:
        --------------------------
          - :: [A_cf(2, 0) x A_cf(0, 0)] -(2)-> A_cf(0, 0)
          - :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          0 :: [] -(0)-> A_cf(0, 0)
          0 :: [] -(0)-> A_cf(2, 0)
          0 :: [] -(0)-> A_cf(2, 4)
          div :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          false :: [] -(0)-> A_cf(0, 0)
          false :: [] -(0)-> A_cf(0, 4)
          if :: [A_cf(0, 0) x A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          lt :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          lt :: [A_cf(0, 0) x A_cf(0, 0)] -(1)-> A_cf(0, 0)
          s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          s :: [A_cf(2, 0)] -(2)-> A_cf(2, 0)
          true :: [] -(0)-> A_cf(0, 0)
          true :: [] -(0)-> A_cf(1, 5)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1, 0)
          0_A :: [] -(0)-> A(0, 1)
          false_A :: [] -(0)-> A(1, 0)
          false_A :: [] -(0)-> A(0, 1)
          s_A :: [A(1, 0)] -(1)-> A(1, 0)
          s_A :: [A(1, 1)] -(0)-> A(0, 1)
          true_A :: [] -(0)-> A(1, 0)
          true_A :: [] -(0)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        -(x,0()) -> x
        -(0(),s(y)) -> 0()
        -(s(x),s(y)) -> -(x,y)
        div(x,0()) -> 0()
        div(0(),y) -> 0()
        div(s(x),s(y)) -> if(lt(x,y),0(),s(div(-(x,y),s(y))))
        if(false(),x,y) -> y
        if(true(),x,y) -> x
        lt(x,0()) -> false()
        lt(0(),s(y)) -> true()
        lt(s(x),s(y)) -> lt(x,y)
    - Signature:
        {-/2,div/2,if/3,lt/2} / {0/0,false/0,s/1,true/0}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {-,div,if,lt} and constructors {0,false,s,true}
Following problems could not be solved:
  - Strict TRS:
      -(x,0()) -> x
      -(0(),s(y)) -> 0()
      -(s(x),s(y)) -> -(x,y)
      div(x,0()) -> 0()
      div(0(),y) -> 0()
      div(s(x),s(y)) -> if(lt(x,y),0(),s(div(-(x,y),s(y))))
      if(false(),x,y) -> y
      if(true(),x,y) -> x
      lt(x,0()) -> false()
      lt(0(),s(y)) -> true()
      lt(s(x),s(y)) -> lt(x,y)
  - Signature:
      {-/2,div/2,if/3,lt/2} / {0/0,false/0,s/1,true/0}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {-,div,if,lt} and constructors {0,false,s,true}
WORST_CASE(?,O(n^2))