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

NO