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