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