NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C)    -> evalfentryin(A,B,C)    True                   (1,1)
          1. evalfentryin(A,B,C)  -> evalfbb3in(C,B,A)      [A >= 1 && B >= 1 + A] (?,1)
          2. evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)       [C >= 1 && B >= 1 + C] (?,1)
          3. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)   [0 >= C]               (?,1)
          4. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)   [C >= B]               (?,1)
          5. evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)      [A >= 1]               (?,1)
          6. evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)      [0 >= A]               (?,1)
          7. evalfbb1in(A,B,C)    -> evalfbb3in(A,B,1 + C)  True                   (?,1)
          8. evalfbb2in(A,B,C)    -> evalfbb3in(A,B,-1 + C) True                   (?,1)
          9. evalfreturnin(A,B,C) -> evalfstop(A,B,C)       True                   (?,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2,3,4},2->{5,6},3->{9},4->{9},5->{7},6->{8},7->{2,3,4},8->{2,3,4},9->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,3),(1,4)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C)    -> evalfentryin(A,B,C)    True                   (1,1)
          1. evalfentryin(A,B,C)  -> evalfbb3in(C,B,A)      [A >= 1 && B >= 1 + A] (?,1)
          2. evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)       [C >= 1 && B >= 1 + C] (?,1)
          3. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)   [0 >= C]               (?,1)
          4. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)   [C >= B]               (?,1)
          5. evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)      [A >= 1]               (?,1)
          6. evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)      [0 >= A]               (?,1)
          7. evalfbb1in(A,B,C)    -> evalfbb3in(A,B,1 + C)  True                   (?,1)
          8. evalfbb2in(A,B,C)    -> evalfbb3in(A,B,-1 + C) True                   (?,1)
          9. evalfreturnin(A,B,C) -> evalfstop(A,B,C)       True                   (?,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2},2->{5,6},3->{9},4->{9},5->{7},6->{8},7->{2,3,4},8->{2,3,4},9->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          evalfstart(A,B,C)    -> evalfentryin(A,B,C)     True
          evalfentryin(A,B,C)  -> evalfbb3in(C,B,A)       [A >= 1 && B >= 1 + A]
          evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)        [C >= 1 && B >= 1 + C]
          evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)    [0 >= C]
          evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)    [C >= B]
          evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)       [A >= 1]
          evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)       [0 >= A]
          evalfbb1in(A,B,C)    -> evalfbb3in(A,B,1 + C)   True
          evalfbb2in(A,B,C)    -> evalfbb3in(A,B,-1 + C)  True
          evalfreturnin(A,B,C) -> evalfstop(A,B,C)        True
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Rule Graph:
          [0->{1},1->{2},2->{5,6},3->{9},4->{9},5->{7},6->{8},7->{2,3,4},8->{2,3,4},9->{}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO