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