WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f0(x1,0(),x3,x4,x5) -> 0()
            f0(x1,S(x),x3,0(),x5) -> 0()
            f0(x1,S(x'),x3,S(x),x5) -> f1(x',S(x'),x,S(x),S(x))
            f1(x1,x2,x3,x4,0()) -> 0()
            f1(x1,x2,x3,x4,S(x)) -> f2(x2,x1,x3,x4,x)
            f2(x1,x2,0(),x4,x5) -> 0()
            f2(x1,x2,S(x),0(),0()) -> 0()
            f2(x1,x2,S(x'),0(),S(x)) -> f3(x1,x2,x',0(),x)
            f2(x1,x2,S(x'),S(x),0()) -> 0()
            f2(x1,x2,S(x''),S(x'),S(x)) -> f5(x1,x2,S(x''),x',x)
            f3(x1,x2,x3,x4,0()) -> 0()
            f3(x1,x2,x3,x4,S(x)) -> f4(x1,x2,x4,x3,x)
            f4(0(),x2,x3,x4,x5) -> 0()
            f4(S(x),0(),x3,x4,0()) -> 0()
            f4(S(x'),0(),x3,x4,S(x)) -> f3(x',0(),x3,x4,x)
            f4(S(x'),S(x),x3,x4,0()) -> 0()
            f4(S(x''),S(x'),x3,x4,S(x)) -> f2(S(x''),x',x3,x4,x)
            f5(x1,x2,x3,x4,0()) -> 0()
            f5(x1,x2,x3,x4,S(x)) -> f6(x2,x1,x3,x4,x)
            f6(x1,x2,x3,x4,0()) -> 0()
            f6(x1,x2,x3,x4,S(x)) -> f0(x1,x2,x4,x3,x)
        - Signature:
            {f0/5,f1/5,f2/5,f3/5,f4/5,f5/5,f6/5} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f0,f1,f2,f3,f4,f5,f6} and constructors {0,S}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(12)
          0 :: [] -(0)-> A(14)
          0 :: [] -(0)-> A(0)
          0 :: [] -(0)-> A(5)
          0 :: [] -(0)-> A(15)
          0 :: [] -(0)-> A(7)
          S :: [A(12)] -(12)-> A(12)
          S :: [A(14)] -(14)-> A(14)
          S :: [A(0)] -(0)-> A(0)
          f0 :: [A(0) x A(12) x A(0) x A(14) x A(0)] -(4)-> A(3)
          f1 :: [A(0) x A(12) x A(14) x A(0) x A(0)] -(12)-> A(3)
          f2 :: [A(12) x A(0) x A(14) x A(0) x A(0)] -(10)-> A(3)
          f3 :: [A(12) x A(0) x A(14) x A(14) x A(0)] -(13)-> A(3)
          f4 :: [A(12) x A(0) x A(14) x A(14) x A(0)] -(12)-> A(3)
          f5 :: [A(12) x A(0) x A(14) x A(0) x A(0)] -(7)-> A(3)
          f6 :: [A(0) x A(12) x A(14) x A(0) x A(0)] -(6)-> A(3)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0)
          S :: [A_cf(0)] -(0)-> A_cf(0)
          f0 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f1 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f2 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f3 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f4 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f5 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          f6 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x 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:
        f0(x1,0(),x3,x4,x5) -> 0()
        f0(x1,S(x),x3,0(),x5) -> 0()
        f0(x1,S(x'),x3,S(x),x5) -> f1(x',S(x'),x,S(x),S(x))
        f1(x1,x2,x3,x4,0()) -> 0()
        f1(x1,x2,x3,x4,S(x)) -> f2(x2,x1,x3,x4,x)
        f2(x1,x2,0(),x4,x5) -> 0()
        f2(x1,x2,S(x),0(),0()) -> 0()
        f2(x1,x2,S(x'),0(),S(x)) -> f3(x1,x2,x',0(),x)
        f2(x1,x2,S(x'),S(x),0()) -> 0()
        f2(x1,x2,S(x''),S(x'),S(x)) -> f5(x1,x2,S(x''),x',x)
        f3(x1,x2,x3,x4,0()) -> 0()
        f3(x1,x2,x3,x4,S(x)) -> f4(x1,x2,x4,x3,x)
        f4(0(),x2,x3,x4,x5) -> 0()
        f4(S(x),0(),x3,x4,0()) -> 0()
        f4(S(x'),0(),x3,x4,S(x)) -> f3(x',0(),x3,x4,x)
        f4(S(x'),S(x),x3,x4,0()) -> 0()
        f4(S(x''),S(x'),x3,x4,S(x)) -> f2(S(x''),x',x3,x4,x)
        f5(x1,x2,x3,x4,0()) -> 0()
        f5(x1,x2,x3,x4,S(x)) -> f6(x2,x1,x3,x4,x)
        f6(x1,x2,x3,x4,0()) -> 0()
        f6(x1,x2,x3,x4,S(x)) -> f0(x1,x2,x4,x3,x)
    - Signature:
        {f0/5,f1/5,f2/5,f3/5,f4/5,f5/5,f6/5} / {0/0,S/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {f0,f1,f2,f3,f4,f5,f6} and constructors {0,S}
Following problems could not be solved:
  - Strict TRS:
      f0(x1,0(),x3,x4,x5) -> 0()
      f0(x1,S(x),x3,0(),x5) -> 0()
      f0(x1,S(x'),x3,S(x),x5) -> f1(x',S(x'),x,S(x),S(x))
      f1(x1,x2,x3,x4,0()) -> 0()
      f1(x1,x2,x3,x4,S(x)) -> f2(x2,x1,x3,x4,x)
      f2(x1,x2,0(),x4,x5) -> 0()
      f2(x1,x2,S(x),0(),0()) -> 0()
      f2(x1,x2,S(x'),0(),S(x)) -> f3(x1,x2,x',0(),x)
      f2(x1,x2,S(x'),S(x),0()) -> 0()
      f2(x1,x2,S(x''),S(x'),S(x)) -> f5(x1,x2,S(x''),x',x)
      f3(x1,x2,x3,x4,0()) -> 0()
      f3(x1,x2,x3,x4,S(x)) -> f4(x1,x2,x4,x3,x)
      f4(0(),x2,x3,x4,x5) -> 0()
      f4(S(x),0(),x3,x4,0()) -> 0()
      f4(S(x'),0(),x3,x4,S(x)) -> f3(x',0(),x3,x4,x)
      f4(S(x'),S(x),x3,x4,0()) -> 0()
      f4(S(x''),S(x'),x3,x4,S(x)) -> f2(S(x''),x',x3,x4,x)
      f5(x1,x2,x3,x4,0()) -> 0()
      f5(x1,x2,x3,x4,S(x)) -> f6(x2,x1,x3,x4,x)
      f6(x1,x2,x3,x4,0()) -> 0()
      f6(x1,x2,x3,x4,S(x)) -> f0(x1,x2,x4,x3,x)
  - Signature:
      {f0/5,f1/5,f2/5,f3/5,f4/5,f5/5,f6/5} / {0/0,S/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {f0,f1,f2,f3,f4,f5,f6} and constructors {0,S}
WORST_CASE(?,O(n^1))