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

NO