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