YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1) -> f7(M1,K1,C,D,100,F,N1,H,I,J,K,L,M,N,O,P,0,R,S,T,U,V,W,O1,Y,P1,S1,Q1,R1,L1,T1,F1,G1,H1,I1,J1) [0 >= M1 && Q = 0 && E = 100 && B = 0 && A = X && Z = 0] (1,1) Signature: {(f6,36);(f7,36)} Flow Graph: [0->{}] + Applied Processor: TrivialSCCs + Details: The problem is already solved. YES(?,O(1))