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