MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f2(A,B,1 + B) [A >= B && A >= 1 && B >= 1]                                                                        (1,1)
          1. f2(A,B,C) -> f3(A,B,C)     [1 + A + -1*C >= 0 && A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + C] (?,1)
          2. f2(A,B,C) -> f3(A,B,C)     [1 + A + -1*C >= 0 && A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1)
          3. f3(A,B,C) -> f2(A,B,0)     [1 + A + -1*C >= 0                                                                                  (?,1)
                                         && A + -1*B >= 0                                                                                        
                                         && -1 + B >= 0                                                                                          
                                         && -2 + A + B >= 0                                                                                      
                                         && -1 + A >= 0                                                                                          
                                         && 1 + A >= 0                                                                                           
                                         && C >= 1                                                                                               
                                         && C >= 1 + A]                                                                                          
          4. f3(A,B,C) -> f2(A,B,1 + C) [1 + A + -1*C >= 0                                                                                  (?,1)
                                         && A + -1*B >= 0                                                                                        
                                         && -1 + B >= 0                                                                                          
                                         && -2 + A + B >= 0                                                                                      
                                         && -1 + A >= 0                                                                                          
                                         && A >= C                                                                                               
                                         && 1 + C >= 0]                                                                                          
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{3,4},3->{1,2},4->{1,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1),(1,3),(3,2)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f2(A,B,1 + B) [A >= B && A >= 1 && B >= 1]                                                                        (1,1)
          1. f2(A,B,C) -> f3(A,B,C)     [1 + A + -1*C >= 0 && A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + C] (?,1)
          2. f2(A,B,C) -> f3(A,B,C)     [1 + A + -1*C >= 0 && A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1)
          3. f3(A,B,C) -> f2(A,B,0)     [1 + A + -1*C >= 0                                                                                  (?,1)
                                         && A + -1*B >= 0                                                                                        
                                         && -1 + B >= 0                                                                                          
                                         && -2 + A + B >= 0                                                                                      
                                         && -1 + A >= 0                                                                                          
                                         && 1 + A >= 0                                                                                           
                                         && C >= 1                                                                                               
                                         && C >= 1 + A]                                                                                          
          4. f3(A,B,C) -> f2(A,B,1 + C) [1 + A + -1*C >= 0                                                                                  (?,1)
                                         && A + -1*B >= 0                                                                                        
                                         && -1 + B >= 0                                                                                          
                                         && -2 + A + B >= 0                                                                                      
                                         && -1 + A >= 0                                                                                          
                                         && A >= C                                                                                               
                                         && 1 + C >= 0]                                                                                          
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Flow Graph:
          [0->{2},1->{4},2->{3,4},3->{1},4->{1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f1(A,B,C) -> f2(A,B,1 + B)  [A >= B && A >= 1 && B >= 1]
          f2(A,B,C) -> f3(A,B,C)      [1 + A + -1*C >= 0
                                       && A + -1*B >= 0
                                       && -1 + B >= 0
                                       && -2 + A + B >= 0
                                       && -1 + A >= 0
                                       && B >= 1 + C]
          f2(A,B,C) -> f3(A,B,C)      [1 + A + -1*C >= 0
                                       && A + -1*B >= 0
                                       && -1 + B >= 0
                                       && -2 + A + B >= 0
                                       && -1 + A >= 0
                                       && C >= 1 + B]
          f3(A,B,C) -> f2(A,B,0)      [1 + A + -1*C >= 0
                                       && A + -1*B >= 0
                                       && -1 + B >= 0
                                       && -2 + A + B >= 0
                                       && -1 + A >= 0
                                       && 1 + A >= 0
                                       && C >= 1
                                       && C >= 1 + A]
          f3(A,B,C) -> f2(A,B,1 + C)  [1 + A + -1*C >= 0
                                       && A + -1*B >= 0
                                       && -1 + B >= 0
                                       && -2 + A + B >= 0
                                       && -1 + A >= 0
                                       && A >= C
                                       && 1 + C >= 0]
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Rule Graph:
          [0->{2},1->{4},2->{3,4},3->{1},4->{1,2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f1(A,B,C) -> f2(A,B,1 + B)     [A >= B && A >= 1 && B >= 1]
        f2(A,B,C) -> f3(A,B,C)         [1 + A + -1*C >= 0
                                        && A + -1*B >= 0
                                        && -1 + B >= 0
                                        && -2 + A + B >= 0
                                        && -1 + A >= 0
                                        && B >= 1 + C]
        f2(A,B,C) -> f3(A,B,C)         [1 + A + -1*C >= 0
                                        && A + -1*B >= 0
                                        && -1 + B >= 0
                                        && -2 + A + B >= 0
                                        && -1 + A >= 0
                                        && C >= 1 + B]
        f3(A,B,C) -> f2(A,B,0)         [1 + A + -1*C >= 0
                                        && A + -1*B >= 0
                                        && -1 + B >= 0
                                        && -2 + A + B >= 0
                                        && -1 + A >= 0
                                        && 1 + A >= 0
                                        && C >= 1
                                        && C >= 1 + A]
        f3(A,B,C) -> f2(A,B,1 + C)     [1 + A + -1*C >= 0
                                        && A + -1*B >= 0
                                        && -1 + B >= 0
                                        && -2 + A + B >= 0
                                        && -1 + A >= 0
                                        && A >= C
                                        && 1 + C >= 0]
        f3(A,B,C) -> exitus616(A,B,C)  True
        f2(A,B,C) -> exitus616(A,B,C)  True
        f3(A,B,C) -> exitus616(A,B,C)  True
        f2(A,B,C) -> exitus616(A,B,C)  True
      Signature:
        {(exitus616,3);(f1,3);(f2,3);(f3,3)}
      Rule Graph:
        [0->{2},1->{4,7},2->{3,4,5},3->{1,8},4->{1,2,6}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8]
        |
        `- p:[2,4,1,3] c: []
MAYBE