MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f20(A,B) -> f1(0,0)         True         (1,1)
          1. f1(A,B)  -> f1(1 + A,1 + B) True         (?,1)
          2. f1(A,B)  -> f30(A,B)        [A >= 1 + B] (?,1)
        Signature:
          {(f1,2);(f20,2);(f30,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f20(A,B) -> f1(0,0)         True         (1,1)
          1. f1(A,B)  -> f1(1 + A,1 + B) True         (?,1)
          2. f1(A,B)  -> f30(A,B)        [A >= 1 + B] (?,1)
        Signature:
          {(f1,2);(f20,2);(f30,2)}
        Flow Graph:
          [0->{1},1->{1,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f20(A,B) -> f1(0,0)          True
          f1(A,B)  -> f1(1 + A,1 + B)  True
          f1(A,B)  -> f30(A,B)         [A >= 1 + B]
        Signature:
          {(f1,2);(f20,2);(f30,2)}
        Rule Graph:
          [0->{1},1->{1,2},2->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f20.0(A,B) -> f1.1(0,0)          True
          f1.1(A,B)  -> f1.1(1 + A,1 + B)  True
          f1.1(A,B)  -> f1.2(1 + A,1 + B)  True
          f1.2(A,B)  -> f30.3(A,B)         [A >= 1 + B]
        Signature:
          {(f1.1,2);(f1.2,2);(f20.0,2);(f30.3,2)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3},3->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f20.0(A,B) -> f1.1(0,0)          True
        f1.1(A,B)  -> f1.1(1 + A,1 + B)  True
        f1.1(A,B)  -> f1.2(1 + A,1 + B)  True
        f1.2(A,B)  -> f30.3(A,B)         [A >= 1 + B]
        f30.3(A,B) -> exitus616(A,B)     True
      Signature:
        {(exitus616,2);(f1.1,2);(f1.2,2);(f20.0,2);(f30.3,2)}
      Rule Graph:
        [0->{1,2},1->{1,2},2->{3},3->{4}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4]
        |
        `- p:[1] c: []
MAYBE