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