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