MAYBE

Problem:
 f(y,f(x,y)) -> f(f(a(),y),f(a(),x))

Proof:
 DP Processor:
  DPs:
   f#(y,f(x,y)) -> f#(a(),x)
   f#(y,f(x,y)) -> f#(a(),y)
   f#(y,f(x,y)) -> f#(f(a(),y),f(a(),x))
  TRS:
   f(y,f(x,y)) -> f(f(a(),y),f(a(),x))
  Arctic Interpretation Processor:
   dimension: 1
   usable rules:
    f(y,f(x,y)) -> f(f(a(),y),f(a(),x))
   interpretation:
    [f#](x0, x1) = -1x0 + x1 + 0,
    
    [a] = 0,
    
    [f](x0, x1) = 1x0 + 1x1 + 1
   orientation:
    f#(y,f(x,y)) = 1x + 1y + 1 >= x + 0 = f#(a(),x)
    
    f#(y,f(x,y)) = 1x + 1y + 1 >= y + 0 = f#(a(),y)
    
    f#(y,f(x,y)) = 1x + 1y + 1 >= 1x + y + 1 = f#(f(a(),y),f(a(),x))
    
    f(y,f(x,y)) = 2x + 2y + 2 >= 2x + 2y + 2 = f(f(a(),y),f(a(),x))
   problem:
    DPs:
     f#(y,f(x,y)) -> f#(f(a(),y),f(a(),x))
    TRS:
     f(y,f(x,y)) -> f(f(a(),y),f(a(),x))
   Restore Modifier:
    DPs:
     f#(y,f(x,y)) -> f#(f(a(),y),f(a(),x))
    TRS:
     f(y,f(x,y)) -> f(f(a(),y),f(a(),x))
    Open