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