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