YES * Step 1: FromIts YES + Considered Problem: Rules: 0. evalSimpleMultiplestart(A,B,C,D) -> evalSimpleMultipleentryin(A,B,C,D) True (1,1) 1. evalSimpleMultipleentryin(A,B,C,D) -> evalSimpleMultiplebb3in(0,0,C,D) True (?,1) 2. evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplebbin(A,B,C,D) [C >= 1 + B] (?,1) 3. evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplereturnin(A,B,C,D) [B >= C] (?,1) 4. evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb1in(A,B,C,D) [D >= 1 + A] (?,1) 5. evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb2in(A,B,C,D) [A >= D] (?,1) 6. evalSimpleMultiplebb1in(A,B,C,D) -> evalSimpleMultiplebb3in(1 + A,B,C,D) True (?,1) 7. evalSimpleMultiplebb2in(A,B,C,D) -> evalSimpleMultiplebb3in(A,1 + B,C,D) True (?,1) 8. evalSimpleMultiplereturnin(A,B,C,D) -> evalSimpleMultiplestop(A,B,C,D) True (?,1) Signature: {(evalSimpleMultiplebb1in,4) ;(evalSimpleMultiplebb2in,4) ;(evalSimpleMultiplebb3in,4) ;(evalSimpleMultiplebbin,4) ;(evalSimpleMultipleentryin,4) ;(evalSimpleMultiplereturnin,4) ;(evalSimpleMultiplestart,4) ;(evalSimpleMultiplestop,4)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: FromIts + Details: () * Step 2: Decompose YES + Considered Problem: Rules: evalSimpleMultiplestart(A,B,C,D) -> evalSimpleMultipleentryin(A,B,C,D) True evalSimpleMultipleentryin(A,B,C,D) -> evalSimpleMultiplebb3in(0,0,C,D) True evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplebbin(A,B,C,D) [C >= 1 + B] evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplereturnin(A,B,C,D) [B >= C] evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb1in(A,B,C,D) [D >= 1 + A] evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb2in(A,B,C,D) [A >= D] evalSimpleMultiplebb1in(A,B,C,D) -> evalSimpleMultiplebb3in(1 + A,B,C,D) True evalSimpleMultiplebb2in(A,B,C,D) -> evalSimpleMultiplebb3in(A,1 + B,C,D) True evalSimpleMultiplereturnin(A,B,C,D) -> evalSimpleMultiplestop(A,B,C,D) True Signature: {(evalSimpleMultiplebb1in,4) ;(evalSimpleMultiplebb2in,4) ;(evalSimpleMultiplebb3in,4) ;(evalSimpleMultiplebbin,4) ;(evalSimpleMultipleentryin,4) ;(evalSimpleMultiplereturnin,4) ;(evalSimpleMultiplestart,4) ;(evalSimpleMultiplestop,4)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[2,6,4,7,5] c: [4,6] | `- p:[2,7,5] c: [2,5,7] * Step 3: CloseWith YES + Considered Problem: (Rules: evalSimpleMultiplestart(A,B,C,D) -> evalSimpleMultipleentryin(A,B,C,D) True evalSimpleMultipleentryin(A,B,C,D) -> evalSimpleMultiplebb3in(0,0,C,D) True evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplebbin(A,B,C,D) [C >= 1 + B] evalSimpleMultiplebb3in(A,B,C,D) -> evalSimpleMultiplereturnin(A,B,C,D) [B >= C] evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb1in(A,B,C,D) [D >= 1 + A] evalSimpleMultiplebbin(A,B,C,D) -> evalSimpleMultiplebb2in(A,B,C,D) [A >= D] evalSimpleMultiplebb1in(A,B,C,D) -> evalSimpleMultiplebb3in(1 + A,B,C,D) True evalSimpleMultiplebb2in(A,B,C,D) -> evalSimpleMultiplebb3in(A,1 + B,C,D) True evalSimpleMultiplereturnin(A,B,C,D) -> evalSimpleMultiplestop(A,B,C,D) True Signature: {(evalSimpleMultiplebb1in,4) ;(evalSimpleMultiplebb2in,4) ;(evalSimpleMultiplebb3in,4) ;(evalSimpleMultiplebbin,4) ;(evalSimpleMultipleentryin,4) ;(evalSimpleMultiplereturnin,4) ;(evalSimpleMultiplestart,4) ;(evalSimpleMultiplestop,4)} Rule Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[2,6,4,7,5] c: [4,6] | `- p:[2,7,5] c: [2,5,7]) + Applied Processor: CloseWith True + Details: () YES