MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fib(s(s(x))) -> if(true(),0(),s(s(x)),0(),0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            if(false(),c,s(s(x)),a,b) -> sum(fibo(a),fibo(b))
            if(true(),c,s(s(x)),a,b) -> if(lt(s(c),s(s(x))),s(c),s(s(x)),b,c)
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib,fibo,if,lt,sum} and constructors {0,false,s,true}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          fib#(0()) -> c_1()
          fib#(s(0())) -> c_2()
          fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
          fibo#(0()) -> c_4(fib#(0()))
          fibo#(s(0())) -> c_5(fib#(s(0())))
          fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
          if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
          if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
          lt#(x,0()) -> c_9()
          lt#(0(),s(x)) -> c_10()
          lt#(s(x),s(y)) -> c_11(lt#(x,y))
          sum#(x,0()) -> c_12()
          sum#(x,s(y)) -> c_13(sum#(x,y))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            fib#(0()) -> c_1()
            fib#(s(0())) -> c_2()
            fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
            fibo#(0()) -> c_4(fib#(0()))
            fibo#(s(0())) -> c_5(fib#(s(0())))
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(x,0()) -> c_9()
            lt#(0(),s(x)) -> c_10()
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,0()) -> c_12()
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fib(s(s(x))) -> if(true(),0(),s(s(x)),0(),0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            if(false(),c,s(s(x)),a,b) -> sum(fibo(a),fibo(b))
            if(true(),c,s(s(x)),a,b) -> if(lt(s(c),s(s(x))),s(c),s(s(x)),b,c)
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          fib(0()) -> s(0())
          fib(s(0())) -> s(0())
          fibo(0()) -> fib(0())
          fibo(s(0())) -> fib(s(0()))
          fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
          lt(x,0()) -> false()
          lt(0(),s(x)) -> true()
          lt(s(x),s(y)) -> lt(x,y)
          sum(x,0()) -> x
          sum(x,s(y)) -> s(sum(x,y))
          fib#(0()) -> c_1()
          fib#(s(0())) -> c_2()
          fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
          fibo#(0()) -> c_4(fib#(0()))
          fibo#(s(0())) -> c_5(fib#(s(0())))
          fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
          if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
          if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
          lt#(x,0()) -> c_9()
          lt#(0(),s(x)) -> c_10()
          lt#(s(x),s(y)) -> c_11(lt#(x,y))
          sum#(x,0()) -> c_12()
          sum#(x,s(y)) -> c_13(sum#(x,y))
* Step 3: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            fib#(0()) -> c_1()
            fib#(s(0())) -> c_2()
            fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
            fibo#(0()) -> c_4(fib#(0()))
            fibo#(s(0())) -> c_5(fib#(s(0())))
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(x,0()) -> c_9()
            lt#(0(),s(x)) -> c_10()
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,0()) -> c_12()
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1,2,9,10,12}
        by application of
          Pre({1,2,9,10,12}) = {4,5,6,7,11,13}.
        Here rules are labelled as follows:
          1: fib#(0()) -> c_1()
          2: fib#(s(0())) -> c_2()
          3: fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
          4: fibo#(0()) -> c_4(fib#(0()))
          5: fibo#(s(0())) -> c_5(fib#(s(0())))
          6: fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
          7: if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
          8: if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
          9: lt#(x,0()) -> c_9()
          10: lt#(0(),s(x)) -> c_10()
          11: lt#(s(x),s(y)) -> c_11(lt#(x,y))
          12: sum#(x,0()) -> c_12()
          13: sum#(x,s(y)) -> c_13(sum#(x,y))
* Step 4: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
            fibo#(0()) -> c_4(fib#(0()))
            fibo#(s(0())) -> c_5(fib#(s(0())))
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak DPs:
            fib#(0()) -> c_1()
            fib#(s(0())) -> c_2()
            lt#(x,0()) -> c_9()
            lt#(0(),s(x)) -> c_10()
            sum#(x,0()) -> c_12()
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {2,3}
        by application of
          Pre({2,3}) = {4,5}.
        Here rules are labelled as follows:
          1: fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
          2: fibo#(0()) -> c_4(fib#(0()))
          3: fibo#(s(0())) -> c_5(fib#(s(0())))
          4: fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
          5: if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
          6: if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
          7: lt#(s(x),s(y)) -> c_11(lt#(x,y))
          8: sum#(x,s(y)) -> c_13(sum#(x,y))
          9: fib#(0()) -> c_1()
          10: fib#(s(0())) -> c_2()
          11: lt#(x,0()) -> c_9()
          12: lt#(0(),s(x)) -> c_10()
          13: sum#(x,0()) -> c_12()
* Step 5: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak DPs:
            fib#(0()) -> c_1()
            fib#(s(0())) -> c_2()
            fibo#(0()) -> c_4(fib#(0()))
            fibo#(s(0())) -> c_5(fib#(s(0())))
            lt#(x,0()) -> c_9()
            lt#(0(),s(x)) -> c_10()
            sum#(x,0()) -> c_12()
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
             -->_1 if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x)))):4
          
          2:S:fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
             -->_3 fibo#(s(0())) -> c_5(fib#(s(0()))):10
             -->_2 fibo#(s(0())) -> c_5(fib#(s(0()))):10
             -->_3 fibo#(0()) -> c_4(fib#(0())):9
             -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
             -->_1 sum#(x,0()) -> c_12():13
             -->_3 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
             -->_2 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
          
          3:S:if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
             -->_3 fibo#(s(0())) -> c_5(fib#(s(0()))):10
             -->_2 fibo#(s(0())) -> c_5(fib#(s(0()))):10
             -->_3 fibo#(0()) -> c_4(fib#(0())):9
             -->_2 fibo#(0()) -> c_4(fib#(0())):9
             -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
             -->_1 sum#(x,0()) -> c_12():13
             -->_3 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
             -->_2 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
          
          4:S:if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
             -->_2 lt#(s(x),s(y)) -> c_11(lt#(x,y)):5
             -->_1 if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x)))):4
             -->_1 if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b)):3
          
          5:S:lt#(s(x),s(y)) -> c_11(lt#(x,y))
             -->_1 lt#(0(),s(x)) -> c_10():12
             -->_1 lt#(x,0()) -> c_9():11
             -->_1 lt#(s(x),s(y)) -> c_11(lt#(x,y)):5
          
          6:S:sum#(x,s(y)) -> c_13(sum#(x,y))
             -->_1 sum#(x,0()) -> c_12():13
             -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
          
          7:W:fib#(0()) -> c_1()
             
          
          8:W:fib#(s(0())) -> c_2()
             
          
          9:W:fibo#(0()) -> c_4(fib#(0()))
             -->_1 fib#(0()) -> c_1():7
          
          10:W:fibo#(s(0())) -> c_5(fib#(s(0())))
             -->_1 fib#(s(0())) -> c_2():8
          
          11:W:lt#(x,0()) -> c_9()
             
          
          12:W:lt#(0(),s(x)) -> c_10()
             
          
          13:W:sum#(x,0()) -> c_12()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          13: sum#(x,0()) -> c_12()
          9: fibo#(0()) -> c_4(fib#(0()))
          7: fib#(0()) -> c_1()
          10: fibo#(s(0())) -> c_5(fib#(s(0())))
          8: fib#(s(0())) -> c_2()
          11: lt#(x,0()) -> c_9()
          12: lt#(0(),s(x)) -> c_10()
* Step 6: RemoveHeads MAYBE
    + Considered Problem:
        - Strict DPs:
            fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        RemoveHeads
    + Details:
        Consider the dependency graph
        
        1:S:fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0()))
           -->_1 if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x)))):4
        
        2:S:fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
           -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
           -->_3 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
           -->_2 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
        
        3:S:if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
           -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
           -->_3 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
           -->_2 fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x)):2
        
        4:S:if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
           -->_2 lt#(s(x),s(y)) -> c_11(lt#(x,y)):5
           -->_1 if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x)))):4
           -->_1 if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b)):3
        
        5:S:lt#(s(x),s(y)) -> c_11(lt#(x,y))
           -->_1 lt#(s(x),s(y)) -> c_11(lt#(x,y)):5
        
        6:S:sum#(x,s(y)) -> c_13(sum#(x,y))
           -->_1 sum#(x,s(y)) -> c_13(sum#(x,y)):6
        
        
        Following roots of the dependency graph are removed, as the considered set of starting terms is closed under reduction with respect to these rules (modulo compound contexts).
        
        [(1,fib#(s(s(x))) -> c_3(if#(true(),0(),s(s(x)),0(),0())))]
* Step 7: NaturalMI MAYBE
    + Considered Problem:
        - Strict DPs:
            fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
            if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
            if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
            lt#(s(x),s(y)) -> c_11(lt#(x,y))
            sum#(x,s(y)) -> c_13(sum#(x,y))
        - Weak TRS:
            fib(0()) -> s(0())
            fib(s(0())) -> s(0())
            fibo(0()) -> fib(0())
            fibo(s(0())) -> fib(s(0()))
            fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
            lt(x,0()) -> false()
            lt(0(),s(x)) -> true()
            lt(s(x),s(y)) -> lt(x,y)
            sum(x,0()) -> x
            sum(x,s(y)) -> s(sum(x,y))
        - Signature:
            {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
            ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
            ,true}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 0, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 0 non-zero interpretation-entries in the diagonal of the component-wise maxima):
        The following argument positions are considered usable:
          uargs(c_6) = {1,2,3},
          uargs(c_7) = {1,2,3},
          uargs(c_8) = {1,2},
          uargs(c_11) = {1},
          uargs(c_13) = {1}
        
        Following symbols are considered usable:
          {lt,fib#,fibo#,if#,lt#,sum#}
        TcT has computed the following interpretation:
              p(0) = [2]                           
          p(false) = [2]                           
            p(fib) = [4]                           
           p(fibo) = [2] x1 + [0]                  
             p(if) = [2] x2 + [1]                  
             p(lt) = [2]                           
              p(s) = [0]                           
            p(sum) = [1] x2 + [3]                  
           p(true) = [2]                           
           p(fib#) = [4]                           
          p(fibo#) = [0]                           
            p(if#) = [4] x1 + [4] x3 + [0]         
            p(lt#) = [0]                           
           p(sum#) = [0]                           
            p(c_1) = [0]                           
            p(c_2) = [1]                           
            p(c_3) = [0]                           
            p(c_4) = [0]                           
            p(c_5) = [0]                           
            p(c_6) = [4] x1 + [1] x2 + [4] x3 + [0]
            p(c_7) = [4] x1 + [1] x2 + [4] x3 + [4]
            p(c_8) = [1] x1 + [2] x2 + [0]         
            p(c_9) = [0]                           
           p(c_10) = [0]                           
           p(c_11) = [2] x1 + [0]                  
           p(c_12) = [1]                           
           p(c_13) = [1] x1 + [0]                  
        
        Following rules are strictly oriented:
        if#(false(),c,s(s(x)),a,b) = [8]                                         
                                   > [4]                                         
                                   = c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
        
        
        Following rules are (at-least) weakly oriented:
                   fibo#(s(s(x))) =  [0]                                                          
                                  >= [0]                                                          
                                  =  c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))           
        
        if#(true(),c,s(s(x)),a,b) =  [8]                                                          
                                  >= [8]                                                          
                                  =  c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
        
                   lt#(s(x),s(y)) =  [0]                                                          
                                  >= [0]                                                          
                                  =  c_11(lt#(x,y))                                               
        
                     sum#(x,s(y)) =  [0]                                                          
                                  >= [0]                                                          
                                  =  c_13(sum#(x,y))                                              
        
                        lt(x,0()) =  [2]                                                          
                                  >= [2]                                                          
                                  =  false()                                                      
        
                     lt(0(),s(x)) =  [2]                                                          
                                  >= [2]                                                          
                                  =  true()                                                       
        
                    lt(s(x),s(y)) =  [2]                                                          
                                  >= [2]                                                          
                                  =  lt(x,y)                                                      
        
* Step 8: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          fibo#(s(s(x))) -> c_6(sum#(fibo(s(x)),fibo(x)),fibo#(s(x)),fibo#(x))
          if#(true(),c,s(s(x)),a,b) -> c_8(if#(lt(s(c),s(s(x))),s(c),s(s(x)),b,c),lt#(s(c),s(s(x))))
          lt#(s(x),s(y)) -> c_11(lt#(x,y))
          sum#(x,s(y)) -> c_13(sum#(x,y))
      - Weak DPs:
          if#(false(),c,s(s(x)),a,b) -> c_7(sum#(fibo(a),fibo(b)),fibo#(a),fibo#(b))
      - Weak TRS:
          fib(0()) -> s(0())
          fib(s(0())) -> s(0())
          fibo(0()) -> fib(0())
          fibo(s(0())) -> fib(s(0()))
          fibo(s(s(x))) -> sum(fibo(s(x)),fibo(x))
          lt(x,0()) -> false()
          lt(0(),s(x)) -> true()
          lt(s(x),s(y)) -> lt(x,y)
          sum(x,0()) -> x
          sum(x,s(y)) -> s(sum(x,y))
      - Signature:
          {fib/1,fibo/1,if/5,lt/2,sum/2,fib#/1,fibo#/1,if#/5,lt#/2,sum#/2} / {0/0,false/0,s/1,true/0,c_1/0,c_2/0,c_3/1
          ,c_4/1,c_5/1,c_6/3,c_7/3,c_8/2,c_9/0,c_10/0,c_11/1,c_12/0,c_13/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {fib#,fibo#,if#,lt#,sum#} and constructors {0,false,s
          ,true}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE