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