NO
* Step 1: Looptree NO
    + 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:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1]
          |
          `- p:[0] c: []

NO