MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J) True (1,1) 1. f1(A,B,C,D,E,F,G,H) -> f300(A,B,I,J,E,K,G,H) [A >= B] (?,1) 2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H) [B >= 1 + A] (?,1) Signature: {(f1,8);(f2,8);(f300,8)} Flow Graph: [0->{1,2},1->{},2->{1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,1)] * Step 2: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J) True (1,1) 1. f1(A,B,C,D,E,F,G,H) -> f300(A,B,I,J,E,K,G,H) [A >= B] (?,1) 2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H) [B >= 1 + A] (?,1) Signature: {(f1,8);(f2,8);(f300,8)} Flow Graph: [0->{1,2},1->{},2->{2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 3: Failure MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J) True (1,1) 1. f1(A,B,C,D,E,F,G,H) -> f300(A,B,I,J,E,K,G,H) [A >= B] (1,1) 2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H) [B >= 1 + A] (?,1) Signature: {(f1,8);(f2,8);(f300,8)} Flow Graph: [0->{1,2},1->{},2->{2}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE