WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            DOUBLE(0()) -> c2()
            DOUBLE(s(z0)) -> c3(DOUBLE(z0))
            MINUS(z0,0()) -> c()
            MINUS(s(z0),s(z1)) -> c1(MINUS(z0,z1))
            PLUS(0(),z0) -> c4()
            PLUS(s(z0),z1) -> c5(PLUS(z0,z1))
            PLUS(s(z0),z1) -> c6(PLUS(z0,s(z1)))
            PLUS(s(z0),z1) -> c7(PLUS(minus(z0,z1),double(z1)),MINUS(z0,z1))
            PLUS(s(z0),z1) -> c8(PLUS(minus(z0,z1),double(z1)),DOUBLE(z1))
        - Weak TRS:
            double(0()) -> 0()
            double(s(z0)) -> s(s(double(z0)))
            minus(z0,0()) -> z0
            minus(s(z0),s(z1)) -> minus(z0,z1)
            plus(0(),z0) -> z0
            plus(s(z0),z1) -> plus(z0,s(z1))
            plus(s(z0),z1) -> s(plus(z0,z1))
            plus(s(z0),z1) -> s(plus(minus(z0,z1),double(z1)))
        - Signature:
            {DOUBLE/1,MINUS/2,PLUS/2,double/1,minus/2,plus/2} / {0/0,c/0,c1/1,c2/0,c3/1,c4/0,c5/1,c6/1,c7/2,c8/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {DOUBLE,MINUS,PLUS,double,minus,plus} and constructors {0
            ,c,c1,c2,c3,c4,c5,c6,c7,c8,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            DOUBLE(0()) -> c2()
            DOUBLE(s(z0)) -> c3(DOUBLE(z0))
            MINUS(z0,0()) -> c()
            MINUS(s(z0),s(z1)) -> c1(MINUS(z0,z1))
            PLUS(0(),z0) -> c4()
            PLUS(s(z0),z1) -> c5(PLUS(z0,z1))
            PLUS(s(z0),z1) -> c6(PLUS(z0,s(z1)))
            PLUS(s(z0),z1) -> c7(PLUS(minus(z0,z1),double(z1)),MINUS(z0,z1))
            PLUS(s(z0),z1) -> c8(PLUS(minus(z0,z1),double(z1)),DOUBLE(z1))
        - Weak TRS:
            double(0()) -> 0()
            double(s(z0)) -> s(s(double(z0)))
            minus(z0,0()) -> z0
            minus(s(z0),s(z1)) -> minus(z0,z1)
            plus(0(),z0) -> z0
            plus(s(z0),z1) -> plus(z0,s(z1))
            plus(s(z0),z1) -> s(plus(z0,z1))
            plus(s(z0),z1) -> s(plus(minus(z0,z1),double(z1)))
        - Signature:
            {DOUBLE/1,MINUS/2,PLUS/2,double/1,minus/2,plus/2} / {0/0,c/0,c1/1,c2/0,c3/1,c4/0,c5/1,c6/1,c7/2,c8/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {DOUBLE,MINUS,PLUS,double,minus,plus} and constructors {0
            ,c,c1,c2,c3,c4,c5,c6,c7,c8,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            DOUBLE(0()) -> c2()
            DOUBLE(s(z0)) -> c3(DOUBLE(z0))
            MINUS(z0,0()) -> c()
            MINUS(s(z0),s(z1)) -> c1(MINUS(z0,z1))
            PLUS(0(),z0) -> c4()
            PLUS(s(z0),z1) -> c5(PLUS(z0,z1))
            PLUS(s(z0),z1) -> c6(PLUS(z0,s(z1)))
            PLUS(s(z0),z1) -> c7(PLUS(minus(z0,z1),double(z1)),MINUS(z0,z1))
            PLUS(s(z0),z1) -> c8(PLUS(minus(z0,z1),double(z1)),DOUBLE(z1))
        - Weak TRS:
            double(0()) -> 0()
            double(s(z0)) -> s(s(double(z0)))
            minus(z0,0()) -> z0
            minus(s(z0),s(z1)) -> minus(z0,z1)
            plus(0(),z0) -> z0
            plus(s(z0),z1) -> plus(z0,s(z1))
            plus(s(z0),z1) -> s(plus(z0,z1))
            plus(s(z0),z1) -> s(plus(minus(z0,z1),double(z1)))
        - Signature:
            {DOUBLE/1,MINUS/2,PLUS/2,double/1,minus/2,plus/2} / {0/0,c/0,c1/1,c2/0,c3/1,c4/0,c5/1,c6/1,c7/2,c8/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {DOUBLE,MINUS,PLUS,double,minus,plus} and constructors {0
            ,c,c1,c2,c3,c4,c5,c6,c7,c8,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          DOUBLE(x){x -> s(x)} =
            DOUBLE(s(x)) ->^+ c3(DOUBLE(x))
              = C[DOUBLE(x) = DOUBLE(x){}]

WORST_CASE(Omega(n^1),?)