NO
* Step 1: Looptree NO
    + Considered Problem:
        Rules:
          0. f1(A,B) -> f2(A,B)        [0 >= 1 + A + B && A >= 1]                                      (1,1)
          1. f2(A,B) -> f2(A + -1*B,B) [-2 + -1*B >= 0 && -3 + A + -1*B >= 0 && -1 + A >= 0 && A >= 0] (?,1)
        Signature:
          {(f1,2);(f2,2)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1]
          |
          `- p:[1] c: []

NO