YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F) -> f17(H,-1,C,0,G,I) True (1,1) 1. f0(A,B,C,D,E,F) -> f17(H,G,I,D,E,F) [G >= 0] (1,1) 2. f0(A,B,C,D,E,F) -> f17(H,G,I,D,E,F) [0 >= 2 + G] (1,1) Signature: {(f0,6);(f17,6)} Flow Graph: [0->{},1->{},2->{}] + Applied Processor: TrivialSCCs + Details: The problem is already solved. YES(?,O(1))