YES(?,O(n^1))
* Step 1: PolyRank WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (?,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (?,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
        Signature:
          {(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
          p(merge) = x2
          p(start) = x2
        
        Following rules are strictly oriented:
        [A >= 1 && B >= 1] ==>                
                merge(A,B)   = B              
                             > -1 + B         
                             = merge(A,-1 + B)
        
        
        Following rules are weakly oriented:
        [A >= 1 && B >= 1] ==>                
                merge(A,B)   = B              
                            >= B              
                             = merge(-1 + A,B)
        
                      True ==>                
                start(A,B)   = B              
                            >= B              
                             = merge(A,B)     
        
        
* Step 2: PolyRank WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (?,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (B,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
        Signature:
          {(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
          p(merge) = x1
          p(start) = x1
        
        Following rules are strictly oriented:
        [A >= 1 && B >= 1] ==>                
                merge(A,B)   = A              
                             > -1 + A         
                             = merge(-1 + A,B)
        
        
        Following rules are weakly oriented:
        [A >= 1 && B >= 1] ==>                
                merge(A,B)   = A              
                            >= A              
                             = merge(A,-1 + B)
        
                      True ==>                
                start(A,B)   = A              
                            >= A              
                             = merge(A,B)     
        
        
* Step 3: KnowledgePropagation WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (A,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (B,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
        Signature:
          {(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        KnowledgePropagation
    + Details:
        The problem is already solved.

YES(?,O(n^1))