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