MAYBE
* Step 1: ArgumentFilter 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:
        ArgumentFilter [1]
    + Details:
        We remove following argument positions: [1].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f2(A)   -> f1(A) [0 >= 1 + A] (?,1)
          1. f300(A) -> f2(A) True         (1,1)
          2. f2(A)   -> f2(A) [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 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f2(A)   -> f1(A) [0 >= 1 + A] (?,1)
          1. f300(A) -> f2(A) True         (1,1)
          2. f2(A)   -> f2(A) [A >= 0]     (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,2},2->{2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f2(A)   -> f1(A)  [0 >= 1 + A]
          f300(A) -> f2(A)  True
          f2(A)   -> f2(A)  [A >= 0]
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Rule Graph:
          [0->{},1->{0,2},2->{2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f2(A)   -> f1(A)         [0 >= 1 + A]
        f300(A) -> f2(A)         True
        f2(A)   -> f2(A)         [A >= 0]
        f2(A)   -> exitus616(A)  True
        f1(A)   -> exitus616(A)  True
      Signature:
        {(exitus616,1);(f1,2);(f2,2);(f300,2)}
      Rule Graph:
        [0->{4},1->{0,2},2->{2,3}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4]
        |
        `- p:[2] c: []
MAYBE