MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f0(-1 + A,C) [0 >= C] (?,1)
          1. f0(A,B) -> f0(1 + A,C)  [C >= 1] (?,1)
          2. f3(A,B) -> f0(2,B)      True     (1,1)
        Signature:
          {(f0,2);(f3,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        ArgumentFilter [0,1]
    + Details:
        We remove following argument positions: [0,1].
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0() -> f0() [0 >= C] (?,1)
          1. f0() -> f0() [C >= 1] (?,1)
          2. f3() -> f0() True     (1,1)
        Signature:
          {(f0,2);(f3,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0() -> f0()  [0 >= C]
          f0() -> f0()  [C >= 1]
          f3() -> f0()  True
        Signature:
          {(f0,2);(f3,2)}
        Rule Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f0() -> f0()         [0 >= C]
        f0() -> f0()         [C >= 1]
        f3() -> f0()         True
        f0() -> exitus616()  True
        f0() -> exitus616()  True
      Signature:
        {(exitus616,0);(f0,2);(f3,2)}
      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