WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            A__F(z0) -> c1(A__IF(mark(z0),c(),f(true())),MARK(z0))
            A__F(z0) -> c2()
            A__IF(z0,z1,z2) -> c5()
            A__IF(false(),z0,z1) -> c4(MARK(z1))
            A__IF(true(),z0,z1) -> c3(MARK(z0))
            MARK(c()) -> c9()
            MARK(f(z0)) -> c6(A__F(mark(z0)),MARK(z0))
            MARK(false()) -> c11()
            MARK(if(z0,z1,z2)) -> c7(A__IF(mark(z0),mark(z1),z2),MARK(z0))
            MARK(if(z0,z1,z2)) -> c8(A__IF(mark(z0),mark(z1),z2),MARK(z1))
            MARK(true()) -> c10()
        - Weak TRS:
            a__f(z0) -> a__if(mark(z0),c(),f(true()))
            a__f(z0) -> f(z0)
            a__if(z0,z1,z2) -> if(z0,z1,z2)
            a__if(false(),z0,z1) -> mark(z1)
            a__if(true(),z0,z1) -> mark(z0)
            mark(c()) -> c()
            mark(f(z0)) -> a__f(mark(z0))
            mark(false()) -> false()
            mark(if(z0,z1,z2)) -> a__if(mark(z0),mark(z1),z2)
            mark(true()) -> true()
        - Signature:
            {A__F/1,A__IF/3,MARK/1,a__f/1,a__if/3,mark/1} / {c/0,c1/2,c10/0,c11/0,c2/0,c3/1,c4/1,c5/0,c6/2,c7/2,c8/2
            ,c9/0,f/1,false/0,if/3,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {A__F,A__IF,MARK,a__f,a__if,mark} and constructors {c,c1
            ,c10,c11,c2,c3,c4,c5,c6,c7,c8,c9,f,false,if,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            A__F(z0) -> c1(A__IF(mark(z0),c(),f(true())),MARK(z0))
            A__F(z0) -> c2()
            A__IF(z0,z1,z2) -> c5()
            A__IF(false(),z0,z1) -> c4(MARK(z1))
            A__IF(true(),z0,z1) -> c3(MARK(z0))
            MARK(c()) -> c9()
            MARK(f(z0)) -> c6(A__F(mark(z0)),MARK(z0))
            MARK(false()) -> c11()
            MARK(if(z0,z1,z2)) -> c7(A__IF(mark(z0),mark(z1),z2),MARK(z0))
            MARK(if(z0,z1,z2)) -> c8(A__IF(mark(z0),mark(z1),z2),MARK(z1))
            MARK(true()) -> c10()
        - Weak TRS:
            a__f(z0) -> a__if(mark(z0),c(),f(true()))
            a__f(z0) -> f(z0)
            a__if(z0,z1,z2) -> if(z0,z1,z2)
            a__if(false(),z0,z1) -> mark(z1)
            a__if(true(),z0,z1) -> mark(z0)
            mark(c()) -> c()
            mark(f(z0)) -> a__f(mark(z0))
            mark(false()) -> false()
            mark(if(z0,z1,z2)) -> a__if(mark(z0),mark(z1),z2)
            mark(true()) -> true()
        - Signature:
            {A__F/1,A__IF/3,MARK/1,a__f/1,a__if/3,mark/1} / {c/0,c1/2,c10/0,c11/0,c2/0,c3/1,c4/1,c5/0,c6/2,c7/2,c8/2
            ,c9/0,f/1,false/0,if/3,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {A__F,A__IF,MARK,a__f,a__if,mark} and constructors {c,c1
            ,c10,c11,c2,c3,c4,c5,c6,c7,c8,c9,f,false,if,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            A__F(z0) -> c1(A__IF(mark(z0),c(),f(true())),MARK(z0))
            A__F(z0) -> c2()
            A__IF(z0,z1,z2) -> c5()
            A__IF(false(),z0,z1) -> c4(MARK(z1))
            A__IF(true(),z0,z1) -> c3(MARK(z0))
            MARK(c()) -> c9()
            MARK(f(z0)) -> c6(A__F(mark(z0)),MARK(z0))
            MARK(false()) -> c11()
            MARK(if(z0,z1,z2)) -> c7(A__IF(mark(z0),mark(z1),z2),MARK(z0))
            MARK(if(z0,z1,z2)) -> c8(A__IF(mark(z0),mark(z1),z2),MARK(z1))
            MARK(true()) -> c10()
        - Weak TRS:
            a__f(z0) -> a__if(mark(z0),c(),f(true()))
            a__f(z0) -> f(z0)
            a__if(z0,z1,z2) -> if(z0,z1,z2)
            a__if(false(),z0,z1) -> mark(z1)
            a__if(true(),z0,z1) -> mark(z0)
            mark(c()) -> c()
            mark(f(z0)) -> a__f(mark(z0))
            mark(false()) -> false()
            mark(if(z0,z1,z2)) -> a__if(mark(z0),mark(z1),z2)
            mark(true()) -> true()
        - Signature:
            {A__F/1,A__IF/3,MARK/1,a__f/1,a__if/3,mark/1} / {c/0,c1/2,c10/0,c11/0,c2/0,c3/1,c4/1,c5/0,c6/2,c7/2,c8/2
            ,c9/0,f/1,false/0,if/3,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {A__F,A__IF,MARK,a__f,a__if,mark} and constructors {c,c1
            ,c10,c11,c2,c3,c4,c5,c6,c7,c8,c9,f,false,if,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          MARK(x){x -> f(x)} =
            MARK(f(x)) ->^+ c6(A__F(mark(x)),MARK(x))
              = C[MARK(x) = MARK(x){}]

WORST_CASE(Omega(n^1),?)