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