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