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