MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. eval(A,B,C)  -> eval(A + B,-2 + B,1 + C) [A >= 0] (?,1)
          1. eval(A,B,C)  -> eval(A + C,B,-2 + C)     [A >= 0] (?,1)
          2. start(A,B,C) -> eval(A,B,C)              True     (1,1)
        Signature:
          {(eval,3);(start,3)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          eval(A,B,C)  -> eval(A + B,-2 + B,1 + C)  [A >= 0]
          eval(A,B,C)  -> eval(A + C,B,-2 + C)      [A >= 0]
          start(A,B,C) -> eval(A,B,C)               True
        Signature:
          {(eval,3);(start,3)}
        Rule Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        eval(A,B,C)  -> eval(A + B,-2 + B,1 + C)  [A >= 0]
        eval(A,B,C)  -> eval(A + C,B,-2 + C)      [A >= 0]
        start(A,B,C) -> eval(A,B,C)               True
        eval(A,B,C)  -> exitus616(A,B,C)          True
        eval(A,B,C)  -> exitus616(A,B,C)          True
      Signature:
        {(eval,3);(exitus616,3);(start,3)}
      Rule Graph:
        [0->{0,1,3},1->{0,1,4},2->{0,1}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4]
        |
        `- p:[0,1] c: []
MAYBE