MAYBE
* Step 1: PolyRank MAYBE
    + Considered Problem:
        Rules:
          0. start(A,B) -> eval(A,B)      True               (1,1)
          1. eval(A,B)  -> eval(A,-1 + B) [A >= 1 && B >= 1] (?,1)
          2. eval(A,B)  -> eval(-1 + A,C) [A >= 1 && B >= 1] (?,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
        
    + Applied Processor:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
           p(eval) = x1
          p(start) = x1
        
        Following rules are strictly oriented:
        [A >= 1 && B >= 1] ==>               
                 eval(A,B)   = A             
                             > -1 + A        
                             = eval(-1 + A,C)
        
        
        Following rules are weakly oriented:
                      True ==>               
                start(A,B)   = A             
                            >= A             
                             = eval(A,B)     
        
        [A >= 1 && B >= 1] ==>               
                 eval(A,B)   = A             
                            >= A             
                             = eval(A,-1 + B)
        
        
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. start(A,B) -> eval(A,B)      True               (1,1)
        1. eval(A,B)  -> eval(A,-1 + B) [A >= 1 && B >= 1] (?,1)
        2. eval(A,B)  -> eval(-1 + A,C) [A >= 1 && B >= 1] (A,1)
      Signature:
        {(eval,2);(start,2)}
      Flow Graph:
        [0->{1,2},1->{1,2},2->{1,2}]
      
  + Applied Processor:
      Failing "Open problems left."
  + Details:
      Open problems left.
MAYBE