NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0.  evalwisestart(A,B)    -> evalwiseentryin(A,B)   True                       (1,1)
          1.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + A]               (?,1)
          2.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + B]               (?,1)
          3.  evalwiseentryin(A,B)  -> evalwisebb6in(B,A)     [A >= 0 && B >= 0]         (?,1)
          4.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [B >= 3 + A]               (?,1)
          5.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [A >= 3 + B]               (?,1)
          6.  evalwisebb6in(A,B)    -> evalwisereturnin(A,B)  [2 + A >= B && 2 + B >= A] (?,1)
          7.  evalwisebb3in(A,B)    -> evalwisebb4in(A,B)     [A >= 1 + B]               (?,1)
          8.  evalwisebb3in(A,B)    -> evalwisebb5in(A,B)     [B >= A]                   (?,1)
          9.  evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B) True                       (?,1)
          10. evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B) True                       (?,1)
          11. evalwisereturnin(A,B) -> evalwisestop(A,B)      True                       (?,1)
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Flow Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6}
          ,11->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(4,7),(5,8)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0.  evalwisestart(A,B)    -> evalwiseentryin(A,B)   True                       (1,1)
          1.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + A]               (?,1)
          2.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + B]               (?,1)
          3.  evalwiseentryin(A,B)  -> evalwisebb6in(B,A)     [A >= 0 && B >= 0]         (?,1)
          4.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [B >= 3 + A]               (?,1)
          5.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [A >= 3 + B]               (?,1)
          6.  evalwisebb6in(A,B)    -> evalwisereturnin(A,B)  [2 + A >= B && 2 + B >= A] (?,1)
          7.  evalwisebb3in(A,B)    -> evalwisebb4in(A,B)     [A >= 1 + B]               (?,1)
          8.  evalwisebb3in(A,B)    -> evalwisebb5in(A,B)     [B >= A]                   (?,1)
          9.  evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B) True                       (?,1)
          10. evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B) True                       (?,1)
          11. evalwisereturnin(A,B) -> evalwisestop(A,B)      True                       (?,1)
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Flow Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{8},5->{7},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6},11->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          evalwisestart(A,B)    -> evalwiseentryin(A,B)    True
          evalwiseentryin(A,B)  -> evalwisereturnin(A,B)   [0 >= 1 + A]
          evalwiseentryin(A,B)  -> evalwisereturnin(A,B)   [0 >= 1 + B]
          evalwiseentryin(A,B)  -> evalwisebb6in(B,A)      [A >= 0 && B >= 0]
          evalwisebb6in(A,B)    -> evalwisebb3in(A,B)      [B >= 3 + A]
          evalwisebb6in(A,B)    -> evalwisebb3in(A,B)      [A >= 3 + B]
          evalwisebb6in(A,B)    -> evalwisereturnin(A,B)   [2 + A >= B && 2 + B >= A]
          evalwisebb3in(A,B)    -> evalwisebb4in(A,B)      [A >= 1 + B]
          evalwisebb3in(A,B)    -> evalwisebb5in(A,B)      [B >= A]
          evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B)  True
          evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B)  True
          evalwisereturnin(A,B) -> evalwisestop(A,B)       True
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Rule Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{8},5->{7},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6},11->{}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO