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