NO
* Step 1: Looptree NO
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B)     True                                                              (1,1)
          1. f1(A,B) -> f1(A,1000 + B) [3000 + -1*A >= 0 && -3000 + A >= 0 && 889 + B >= 0 && 3999 >= A] (?,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