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

NO