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