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

NO