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