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