MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (?,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (?,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (?,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(10,9)] * Step 2: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (?,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (?,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (?,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 3: PolyRank MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (1,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (1,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (1,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: PolyRank {useFarkas = True, withSizebounds = [], shape = Linear} + Details: We apply a polynomial interpretation of shape linear: p(evalfbb10in) = x4 p(evalfbb3in) = x4 p(evalfbb4in) = x4 p(evalfbb5in) = x4 p(evalfbb6in) = x4 p(evalfbb7in) = x4 p(evalfbb8in) = x4 p(evalfbb9in) = x4 p(evalfentryin) = x1 p(evalfreturnin) = x4 p(evalfstart) = x1 p(evalfstop) = x4 Following rules are strictly oriented: [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] ==> evalfbb9in(A,B,C,D,E,F,G) = D > -1 + D = evalfbb10in(A,B,C,-1 + D,E,F,G) Following rules are weakly oriented: True ==> evalfstart(A,B,C,D,E,F,G) = A >= A = evalfentryin(A,B,C,D,E,F,G) True ==> evalfentryin(A,B,C,D,E,F,G) = A >= A = evalfbb10in(B,C,D,A,E,F,G) [D >= 1] ==> evalfbb10in(A,B,C,D,E,F,G) = D >= D = evalfbb8in(A,B,C,D,1,F,G) [0 >= D] ==> evalfbb10in(A,B,C,D,E,F,G) = D >= D = evalfreturnin(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] ==> evalfbb8in(A,B,C,D,E,F,G) = D >= D = evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] ==> evalfbb8in(A,B,C,D,E,F,G) = D >= D = evalfbb9in(A,B,C,D,E,F,G) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] evalfbb6in(A,B,C,D,E,F,G) = D >= D = evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] evalfbb6in(A,B,C,D,E,F,G) = D >= D = evalfbb7in(A,B,C,D,E,F,G) [C + -1*G >= 0 ==> && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] evalfbb4in(A,B,C,D,E,F,G) = D >= D = evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 ==> && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] evalfbb4in(A,B,C,D,E,F,G) = D >= D = evalfbb5in(A,B,C,D,E,F,G) [E + -1*G >= 0 ==> && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb3in(A,B,C,D,E,F,G) = D >= D = evalfbb4in(A,B,C,D,E,F,-1 + G) [C + -1*G >= 0 ==> && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in(A,B,C,D,E,F,G) = D >= D = evalfbb6in(A,B,C,D,E,1 + F,G) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] evalfbb7in(A,B,C,D,E,F,G) = D >= D = evalfbb8in(A,B,C,D,1 + E,F,G) [-1*D >= 0] ==> evalfreturnin(A,B,C,D,E,F,G) = D >= D = evalfstop(A,B,C,D,E,F,G) * Step 4: KnowledgePropagation MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (1,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (1,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (A,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (1,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: KnowledgePropagation + Details: We propagate bounds from predecessors. * Step 5: PolyRank MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (1,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (1 + A,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (1,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (A,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (1,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: PolyRank {useFarkas = True, withSizebounds = [], shape = Linear} + Details: We apply a polynomial interpretation of shape linear: p(evalfbb10in) = x4 p(evalfbb3in) = x4 p(evalfbb4in) = x4 p(evalfbb5in) = x4 p(evalfbb6in) = x4 p(evalfbb7in) = x4 p(evalfbb8in) = x4 p(evalfbb9in) = -1 + x4 p(evalfentryin) = x1 p(evalfreturnin) = x4 p(evalfstart) = x1 p(evalfstop) = x4 Following rules are strictly oriented: [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] ==> evalfbb8in(A,B,C,D,E,F,G) = D > -1 + D = evalfbb9in(A,B,C,D,E,F,G) Following rules are weakly oriented: True ==> evalfstart(A,B,C,D,E,F,G) = A >= A = evalfentryin(A,B,C,D,E,F,G) True ==> evalfentryin(A,B,C,D,E,F,G) = A >= A = evalfbb10in(B,C,D,A,E,F,G) [D >= 1] ==> evalfbb10in(A,B,C,D,E,F,G) = D >= D = evalfbb8in(A,B,C,D,1,F,G) [0 >= D] ==> evalfbb10in(A,B,C,D,E,F,G) = D >= D = evalfreturnin(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] ==> evalfbb8in(A,B,C,D,E,F,G) = D >= D = evalfbb6in(A,B,C,D,E,D,G) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] evalfbb6in(A,B,C,D,E,F,G) = D >= D = evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] evalfbb6in(A,B,C,D,E,F,G) = D >= D = evalfbb7in(A,B,C,D,E,F,G) [C + -1*G >= 0 ==> && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] evalfbb4in(A,B,C,D,E,F,G) = D >= D = evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 ==> && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] evalfbb4in(A,B,C,D,E,F,G) = D >= D = evalfbb5in(A,B,C,D,E,F,G) [E + -1*G >= 0 ==> && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb3in(A,B,C,D,E,F,G) = D >= D = evalfbb4in(A,B,C,D,E,F,-1 + G) [C + -1*G >= 0 ==> && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] evalfbb5in(A,B,C,D,E,F,G) = D >= D = evalfbb6in(A,B,C,D,E,1 + F,G) [-1 + F >= 0 ==> && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] evalfbb7in(A,B,C,D,E,F,G) = D >= D = evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] ==> evalfbb9in(A,B,C,D,E,F,G) = -1 + D >= -1 + D = evalfbb10in(A,B,C,-1 + D,E,F,G) [-1*D >= 0] ==> evalfreturnin(A,B,C,D,E,F,G) = D >= D = evalfstop(A,B,C,D,E,F,G) * Step 6: Failure MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F,G) -> evalfentryin(A,B,C,D,E,F,G) True (1,1) 1. evalfentryin(A,B,C,D,E,F,G) -> evalfbb10in(B,C,D,A,E,F,G) True (1,1) 2. evalfbb10in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1,F,G) [D >= 1] (1 + A,1) 3. evalfbb10in(A,B,C,D,E,F,G) -> evalfreturnin(A,B,C,D,E,F,G) [0 >= D] (1,1) 4. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,D,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && A >= E] (?,1) 5. evalfbb8in(A,B,C,D,E,F,G) -> evalfbb9in(A,B,C,D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + D >= 0 && E >= 1 + A] (A,1) 6. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,C) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && B >= F] 7. evalfbb6in(A,B,C,D,E,F,G) -> evalfbb7in(A,B,C,D,E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0 && F >= 1 + B] 8. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb3in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= G] 9. evalfbb4in(A,B,C,D,E,F,G) -> evalfbb5in(A,B,C,D,E,F,G) [C + -1*G >= 0 (?,1) && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && G >= 1 + E] 10. evalfbb3in(A,B,C,D,E,F,G) -> evalfbb4in(A,B,C,D,E,F,-1 + G) [E + -1*G >= 0 (?,1) && C + -1*G >= 0 && A + -1*G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E,F,G) -> evalfbb6in(A,B,C,D,E,1 + F,G) [C + -1*G >= 0 (?,1) && -2 + G >= 0 && -3 + F + G >= 0 && -3 + E + G >= 0 && -1 + -1*E + G >= 0 && -3 + D + G >= 0 && -4 + C + G >= 0 && -3 + B + G >= 0 && -3 + A + G >= 0 && B + -1*F >= 0 && -1 + F >= 0 && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -3 + C + F >= 0 && -2 + B + F >= 0 && -2 + A + F >= 0 && -1 + C + -1*E >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && B + -1*D >= 0 && -1 + D >= 0 && -3 + C + D >= 0 && -2 + B + D >= 0 && -2 + A + D >= 0 && -2 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E,F,G) -> evalfbb8in(A,B,C,D,1 + E,F,G) [-1 + F >= 0 (?,1) && -2 + E + F >= 0 && -2 + D + F >= 0 && -1*D + F >= 0 && -1 + -1*B + F >= 0 && -2 + A + F >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + D + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + A + D >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E,F,G) -> evalfbb10in(A,B,C,-1 + D,E,F,G) [-1 + E >= 0 && -2 + D + E >= 0 && -1 + -1*A + E >= 0 && -1 + D >= 0] (A,1) 14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G) [-1*D >= 0] (1,1) Signature: {(evalfbb10in,7) ;(evalfbb3in,7) ;(evalfbb4in,7) ;(evalfbb5in,7) ;(evalfbb6in,7) ;(evalfbb7in,7) ;(evalfbb8in,7) ;(evalfbb9in,7) ;(evalfentryin,7) ;(evalfreturnin,7) ;(evalfstart,7) ;(evalfstop,7)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE