WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            p(m,n,s(r)) -> p(m,r,n)
            p(m,0(),0()) -> m
            p(m,s(n),0()) -> p(0(),n,m)
        - Signature:
            {p/3} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {p} 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(2)
          0 :: [] -(0)-> A(14)
          p :: [A(14) x A(2) x A(2)] -(8)-> A(0)
          s :: [A(2)] -(2)-> A(2)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0)
          p :: [A_cf(0) x A_cf(0) x 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:
        p(m,n,s(r)) -> p(m,r,n)
        p(m,0(),0()) -> m
        p(m,s(n),0()) -> p(0(),n,m)
    - Signature:
        {p/3} / {0/0,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {p} and constructors {0,s}
Following problems could not be solved:
  - Strict TRS:
      p(m,n,s(r)) -> p(m,r,n)
      p(m,0(),0()) -> m
      p(m,s(n),0()) -> p(0(),n,m)
  - Signature:
      {p/3} / {0/0,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {p} and constructors {0,s}
WORST_CASE(?,O(n^1))