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