YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. sumto(A,B) -> end(A,B)       [A >= 1 + B] (?,1)
          1. sumto(A,B) -> sumto(1 + A,B) [B >= A]     (?,1)
          2. start(A,B) -> sumto(A,B)     True         (1,1)
        Signature:
          {(end,2);(start,2);(sumto,2)}
        Flow Graph:
          [0->{},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          sumto(A,B) -> end(A,B)        [A >= 1 + B]
          sumto(A,B) -> sumto(1 + A,B)  [B >= A]
          start(A,B) -> sumto(A,B)      True
        Signature:
          {(end,2);(start,2);(sumto,2)}
        Rule Graph:
          [0->{},1->{0,1},2->{0,1}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          sumto(A,B) -> end(A,B)        [A >= 1 + B]
          sumto(A,B) -> sumto(1 + A,B)  [B >= A]
          start(A,B) -> sumto(A,B)      True
        Signature:
          {(end,2);(start,2);(sumto,2)}
        Rule Graph:
          [0->{},1->{0,1},2->{0,1}]
        ,We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES