YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. start(A,B,C,D) -> lbl41(E,B,C,D) [A = B && C = D] (?,1) 1. lbl41(A,B,C,D) -> stop(A,B,A,D) [C = D] (?,1) 2. start0(A,B,C,D) -> start(B,B,D,D) True (1,1) Signature: {(lbl41,4);(start,4);(start0,4);(stop,4)} Flow Graph: [0->{1},1->{},2->{0}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. start(A,B,C,D) -> lbl41(E,B,C,D) [A = B && C = D] (1,1) 1. lbl41(A,B,C,D) -> stop(A,B,A,D) [C = D] (1,1) 2. start0(A,B,C,D) -> start(B,B,D,D) True (1,1) Signature: {(lbl41,4);(start,4);(start0,4);(stop,4)} Flow Graph: [0->{1},1->{},2->{0}] + Applied Processor: UnsatRules + Details: The problem is already solved. YES(?,O(1))