YES * Step 1: FromIts YES + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True (1,1) 1. evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True (?,1) 2. evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] (?,1) 3. evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] (?,1) 4. evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] (?,1) 5. evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] (?,1) 6. evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 7. evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] (?,1) 8. evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] (?,1) 9. evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 10. evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] (?,1) 11. evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] (?,1) 12. evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] (?,1) Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{}] + Applied Processor: FromIts + Details: () * Step 2: Decompose YES + Considered Problem: Rules: evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,11,5,10,8,6,4,9,7] c: [2,5,11] | `- p:[4,10,8,6,9,7] c: [4,6,8,10] | `- p:[7,9] c: [7,9] * Step 3: CloseWith YES + Considered Problem: (Rules: evalfstart(A,B,C,D,E,F) -> evalfentryin(A,B,C,D,E,F) True evalfentryin(A,B,C,D,E,F) -> evalfbb7in(B,C,D,A,E,F) True evalfbb7in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,B,F) [A >= D] evalfbb7in(A,B,C,D,E,F) -> evalfreturnin(A,B,C,D,E,F) [D >= 1 + A] evalfbb5in(A,B,C,D,E,F) -> evalfbb1in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && C >= E] evalfbb5in(A,B,C,D,E,F) -> evalfbb6in(A,B,C,D,E,F) [-1*B + E >= 0 && A + -1*D >= 0 && E >= 1 + C] evalfbb1in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,D + -1*E) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb3in(A,B,C,D,E,F) -> evalfbb2in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && D + E >= F] evalfbb3in(A,B,C,D,E,F) -> evalfbb4in(A,B,C,D,E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0 && F >= 1 + D + E] evalfbb2in(A,B,C,D,E,F) -> evalfbb3in(A,B,C,D,E,1 + F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb4in(A,B,C,D,E,F) -> evalfbb5in(A,B,C,D,1 + E,F) [C + -1*E >= 0 && -1*B + E >= 0 && A + -1*D >= 0 && -1*B + C >= 0] evalfbb6in(A,B,C,D,E,F) -> evalfbb7in(A,B,C,1 + D,E,F) [-1 + -1*C + E >= 0 && -1*B + E >= 0 && A + -1*D >= 0] evalfreturnin(A,B,C,D,E,F) -> evalfstop(A,B,C,D,E,F) [-1 + -1*A + D >= 0] Signature: {(evalfbb1in,6) ;(evalfbb2in,6) ;(evalfbb3in,6) ;(evalfbb4in,6) ;(evalfbb5in,6) ;(evalfbb6in,6) ;(evalfbb7in,6) ;(evalfentryin,6) ;(evalfreturnin,6) ;(evalfstart,6) ;(evalfstop,6)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{12},4->{6},5->{11},6->{7,8},7->{9},8->{10},9->{7,8},10->{4,5},11->{2,3} ,12->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[2,11,5,10,8,6,4,9,7] c: [2,5,11] | `- p:[4,10,8,6,9,7] c: [4,6,8,10] | `- p:[7,9] c: [7,9]) + Applied Processor: CloseWith True + Details: () YES