YES * Step 1: UnsatPaths YES + Considered Problem: Rules: 0. start(A,B,C,D,E) -> eval(A,B,C,D,E) True (1,1) 1. eval(A,B,C,D,E) -> eval(A,1 + B,C,D,1 + E) [A >= 1 + B && D >= C] (?,1) 2. eval(A,B,C,D,E) -> eval(A,B,C,1 + D,1 + E) [B >= A && C >= 1 + D] (?,1) 3. eval(A,B,C,D,E) -> eval(A,B,C,1 + D,1 + E) [A >= 1 + B && C >= 1 + D] (?,1) 4. eval(A,B,C,D,E) -> eval(A,1 + B,C,D,1 + E) [A >= 1 + B && C >= 1 + D] (?,1) Signature: {(eval,5);(start,5)} Flow Graph: [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{1,2,3,4}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(1,3),(1,4),(2,1),(2,3),(2,4),(3,2),(4,1)] * Step 2: Looptree YES + Considered Problem: Rules: 0. start(A,B,C,D,E) -> eval(A,B,C,D,E) True (1,1) 1. eval(A,B,C,D,E) -> eval(A,1 + B,C,D,1 + E) [A >= 1 + B && D >= C] (?,1) 2. eval(A,B,C,D,E) -> eval(A,B,C,1 + D,1 + E) [B >= A && C >= 1 + D] (?,1) 3. eval(A,B,C,D,E) -> eval(A,B,C,1 + D,1 + E) [A >= 1 + B && C >= 1 + D] (?,1) 4. eval(A,B,C,D,E) -> eval(A,1 + B,C,D,1 + E) [A >= 1 + B && C >= 1 + D] (?,1) Signature: {(eval,5);(start,5)} Flow Graph: [0->{1,2,3,4},1->{1},2->{2},3->{1,3,4},4->{2,3,4}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4] | +- p:[3,4] c: [4] | | | `- p:[3] c: [3] | +- p:[2] c: [2] | `- p:[1] c: [1] YES