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