NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] (?,1) 1. f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] (?,1) 2. f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] (?,1) 3. f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] (?,1) 4. f2(A,B,C) -> f2(A,0,C) [A >= 1] (?,1) 5. f2(A,B,C) -> f1(A,0,D) [0 >= A] (?,1) 6. f300(A,B,C) -> f2(A,B,C) True (1,1) Signature: {(f1,3);(f2,3);(f300,3)} Flow Graph: [0->{0,1,2,3,4,5},1->{0,1,2,3,4,5},2->{},3->{},4->{0,1,2,3,4,5},5->{},6->{0,1,2,3,4,5}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,5),(1,5),(4,5)] * Step 2: FromIts NO + Considered Problem: Rules: 0. f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] (?,1) 1. f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] (?,1) 2. f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] (?,1) 3. f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] (?,1) 4. f2(A,B,C) -> f2(A,0,C) [A >= 1] (?,1) 5. f2(A,B,C) -> f1(A,0,D) [0 >= A] (?,1) 6. f300(A,B,C) -> f2(A,B,C) True (1,1) Signature: {(f1,3);(f2,3);(f300,3)} Flow Graph: [0->{0,1,2,3,4},1->{0,1,2,3,4},2->{},3->{},4->{0,1,2,3,4},5->{},6->{0,1,2,3,4,5}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] f2(A,B,C) -> f2(A,0,C) [A >= 1] f2(A,B,C) -> f1(A,0,D) [0 >= A] f300(A,B,C) -> f2(A,B,C) True Signature: {(f1,3);(f2,3);(f300,3)} Rule Graph: [0->{0,1,2,3,4},1->{0,1,2,3,4},2->{},3->{},4->{0,1,2,3,4},5->{},6->{0,1,2,3,4,5}] + Applied Processor: CloseWith False + Details: () NO