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