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