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