MAYBE

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

Proof:
 DP Processor:
  DPs:
   f#(x,f(a(),y)) -> f#(a(),x)
   f#(x,f(a(),y)) -> f#(a(),h(f(a(),x)))
   f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
   f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
  TRS:
   f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y))
  EDG Processor:
   DPs:
    f#(x,f(a(),y)) -> f#(a(),x)
    f#(x,f(a(),y)) -> f#(a(),h(f(a(),x)))
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
   TRS:
    f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y))
   graph:
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) ->
    f#(x,f(a(),y)) -> f#(a(),x)
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) ->
    f#(x,f(a(),y)) -> f#(a(),h(f(a(),x)))
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) ->
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) ->
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) ->
    f#(x,f(a(),y)) -> f#(a(),x)
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) ->
    f#(x,f(a(),y)) -> f#(a(),h(f(a(),x)))
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) ->
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) ->
    f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
    f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),x)
    f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x)))
    f#(x,f(a(),y)) -> f#(a(),x) ->
    f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
    f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
   SCC Processor:
    #sccs: 1
    #rules: 3
    #arcs: 12/16
    DPs:
     f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
     f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
     f#(x,f(a(),y)) -> f#(a(),x)
    TRS:
     f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y))
    Matrix Interpretation Processor:
     dimension: 1
     interpretation:
      [f#](x0, x1) = x0 + x1,
      
      [h](x0) = 0,
      
      [f](x0, x1) = x1 + 1,
      
      [a] = 0
     orientation:
      f#(x,f(a(),y)) = x + y + 1 >= y + 1 = f#(f(a(),h(f(a(),x))),y)
      
      f#(x,f(a(),y)) = x + y + 1 >= y + 1 = f#(a(),f(f(a(),h(f(a(),x))),y))
      
      f#(x,f(a(),y)) = x + y + 1 >= x = f#(a(),x)
      
      f(x,f(a(),y)) = y + 2 >= y + 2 = f(a(),f(f(a(),h(f(a(),x))),y))
     problem:
      DPs:
       f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y)
       f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
      TRS:
       f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y))
     Matrix Interpretation Processor:
      dimension: 1
      interpretation:
       [f#](x0, x1) = x1,
       
       [h](x0) = 0,
       
       [f](x0, x1) = x1 + 1,
       
       [a] = 0
      orientation:
       f#(x,f(a(),y)) = y + 1 >= y = f#(f(a(),h(f(a(),x))),y)
       
       f#(x,f(a(),y)) = y + 1 >= y + 1 = f#(a(),f(f(a(),h(f(a(),x))),y))
       
       f(x,f(a(),y)) = y + 2 >= y + 2 = f(a(),f(f(a(),h(f(a(),x))),y))
      problem:
       DPs:
        f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y))
       TRS:
        f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y))
      Open