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

WORST_CASE(Omega(n^1),?)