MAYBE * Step 1: PolyRank MAYBE + Considered Problem: Rules: 0. f0(A,B,C) -> f2(A,B,C) [A >= 0 && B >= C] (1,1) 1. f2(A,B,C) -> f2(-1 + A,B,-1 + C) [B + -1*C >= 0 && A >= 0 && A >= 1 && 1 + B >= C] (?,1) 2. f2(A,B,C) -> f2(A,-1 + B + C,-1 + C) [B + -1*C >= 0 && A >= 0 && B >= 0] (?,1) Signature: {(f0,3);(f2,3)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: PolyRank {useFarkas = True, withSizebounds = [], shape = Linear} + Details: We apply a polynomial interpretation of shape linear: p(f0) = 1 + x1 p(f2) = 1 + x1 Following rules are strictly oriented: [B + -1*C >= 0 && A >= 0 && A >= 1 && 1 + B >= C] ==> f2(A,B,C) = 1 + A > A = f2(-1 + A,B,-1 + C) Following rules are weakly oriented: [A >= 0 && B >= C] ==> f0(A,B,C) = 1 + A >= 1 + A = f2(A,B,C) [B + -1*C >= 0 && A >= 0 && B >= 0] ==> f2(A,B,C) = 1 + A >= 1 + A = f2(A,-1 + B + C,-1 + C) * Step 2: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B,C) -> f2(A,B,C) [A >= 0 && B >= C] (1,1) 1. f2(A,B,C) -> f2(-1 + A,B,-1 + C) [B + -1*C >= 0 && A >= 0 && A >= 1 && 1 + B >= C] (1 + A,1) 2. f2(A,B,C) -> f2(A,-1 + B + C,-1 + C) [B + -1*C >= 0 && A >= 0 && B >= 0] (?,1) Signature: {(f0,3);(f2,3)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE