We consider the following Problem:

  Strict Trs: {*(x, *(minus(y), y)) -> *(minus(*(y, y)), x)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: YES(?,O(n^1))

Proof:
  We consider the following Problem:
  
    Strict Trs: {*(x, *(minus(y), y)) -> *(minus(*(y, y)), x)}
    StartTerms: basic terms
    Strategy: innermost
  
  Certificate: YES(?,O(n^1))
  
  Proof:
    We consider the following Problem:
    
      Strict Trs: {*(x, *(minus(y), y)) -> *(minus(*(y, y)), x)}
      StartTerms: basic terms
      Strategy: innermost
    
    Certificate: YES(?,O(n^1))
    
    Proof:
      The following argument positions are usable:
        Uargs(*) = {1}, Uargs(minus) = {1}
      We have the following constructor-based EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
      Interpretation Functions:
       *(x1, x2) = [1 2] x1 + [0 1] x2 + [0]
                   [2 3]      [2 3]      [3]
       minus(x1) = [1 0] x1 + [0]
                   [0 0]      [0]

Hurray, we answered YES(?,O(n^1))