MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E,F) -> f0(G,0,0,H,G,G)     True                                                                                          (1,1)
          1. f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H) [0 >= 1 + G && H >= 1]                                                                        (1,1)
          2. f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H) [G >= 1 && H >= 1]                                                                            (1,1)
          3. f2(A,B,C,D,E,F) -> f0(A,0,0,G,E,F)     [-1 + A + -1*F >= 0 && -1 + F >= 0 && -3 + A + F >= 0 && -2 + A >= 0]                         (?,1)
          4. f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F) [-1 + A + -1*F >= 0 && -1 + F >= 0 && -3 + A + F >= 0 && -2 + A >= 0 && 0 >= 1 + G && A >= 1] (?,1)
          5. f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F) [-1 + A + -1*F >= 0 && -1 + F >= 0 && -3 + A + F >= 0 && -2 + A >= 0 && G >= 1 && A >= 1]     (?,1)
        Signature:
          {(f0,6);(f2,6);(f4,6)}
        Flow Graph:
          [0->{},1->{3,4,5},2->{3,4,5},3->{},4->{3,4,5},5->{3,4,5}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f4(A,B,C,D,E,F) -> f0(G,0,0,H,G,G)      True
          f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H)  [0 >= 1 + G && H >= 1]
          f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H)  [G >= 1 && H >= 1]
          f2(A,B,C,D,E,F) -> f0(A,0,0,G,E,F)      [-1 + A + -1*F >= 0
                                                   && -1 + F >= 0
                                                   && -3 + A + F >= 0
                                                   && -2 + A >= 0]
          f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F)  [-1 + A + -1*F >= 0
                                                   && -1 + F >= 0
                                                   && -3 + A + F >= 0
                                                   && -2 + A >= 0
                                                   && 0 >= 1 + G
                                                   && A >= 1]
          f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F)  [-1 + A + -1*F >= 0
                                                   && -1 + F >= 0
                                                   && -3 + A + F >= 0
                                                   && -2 + A >= 0
                                                   && G >= 1
                                                   && A >= 1]
        Signature:
          {(f0,6);(f2,6);(f4,6)}
        Rule Graph:
          [0->{},1->{3,4,5},2->{3,4,5},3->{},4->{3,4,5},5->{3,4,5}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        f4(A,B,C,D,E,F) -> f0(G,0,0,H,G,G)         True
        f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H)     [0 >= 1 + G && H >= 1]
        f4(A,B,C,D,E,F) -> f2(1 + H,G,G,D,H,H)     [G >= 1 && H >= 1]
        f2(A,B,C,D,E,F) -> f0(A,0,0,G,E,F)         [-1 + A + -1*F >= 0
                                                    && -1 + F >= 0
                                                    && -3 + A + F >= 0
                                                    && -2 + A >= 0]
        f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F)     [-1 + A + -1*F >= 0
                                                    && -1 + F >= 0
                                                    && -3 + A + F >= 0
                                                    && -2 + A >= 0
                                                    && 0 >= 1 + G
                                                    && A >= 1]
        f2(A,B,C,D,E,F) -> f2(1 + A,G,G,D,E,F)     [-1 + A + -1*F >= 0
                                                    && -1 + F >= 0
                                                    && -3 + A + F >= 0
                                                    && -2 + A >= 0
                                                    && G >= 1
                                                    && A >= 1]
        f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)  True
        f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)  True
        f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)  True
      Signature:
        {(exitus616,6);(f0,6);(f2,6);(f4,6)}
      Rule Graph:
        [0->{8},1->{3,4,5},2->{3,4,5},3->{6,7},4->{3,4,5},5->{3,4,5}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8]
        |
        `- p:[4,5] c: []
MAYBE