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