YES * Step 1: FromIts YES + Considered Problem: Rules: 0. f1(A,B) -> f1(11 + A,1 + B) [B >= 1 && 100 >= A] (?,1) 1. f1(A,B) -> f1(-10 + A,-1 + B) [B >= 1 && A >= 101] (?,1) 2. f0(A,B) -> f1(C,1) True (1,1) Signature: {(f0,2);(f1,2)} Flow Graph: [0->{0,1},1->{0,1},2->{0,1}] + Applied Processor: FromIts + Details: () * Step 2: Decompose YES + Considered Problem: Rules: f1(A,B) -> f1(11 + A,1 + B) [B >= 1 && 100 >= A] f1(A,B) -> f1(-10 + A,-1 + B) [B >= 1 && A >= 101] f0(A,B) -> f1(C,1) True Signature: {(f0,2);(f1,2)} Rule Graph: [0->{0,1},1->{0,1},2->{0,1}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2] | `- p:[0,1] c: [0] | `- p:[1] c: [1] * Step 3: CloseWith YES + Considered Problem: (Rules: f1(A,B) -> f1(11 + A,1 + B) [B >= 1 && 100 >= A] f1(A,B) -> f1(-10 + A,-1 + B) [B >= 1 && A >= 101] f0(A,B) -> f1(C,1) True Signature: {(f0,2);(f1,2)} Rule Graph: [0->{0,1},1->{0,1},2->{0,1}] ,We construct a looptree: P: [0,1,2] | `- p:[0,1] c: [0] | `- p:[1] c: [1]) + Applied Processor: CloseWith True + Details: () YES