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