YES

Problem:
 f(s(x),y) -> f(x,g(x,y))
 f(0(),y) -> y
 g(x,y) -> y

Proof:
 DP Processor:
  DPs:
   f#(s(x),y) -> g#(x,y)
   f#(s(x),y) -> f#(x,g(x,y))
  TRS:
   f(s(x),y) -> f(x,g(x,y))
   f(0(),y) -> y
   g(x,y) -> y
  TDG Processor:
   DPs:
    f#(s(x),y) -> g#(x,y)
    f#(s(x),y) -> f#(x,g(x,y))
   TRS:
    f(s(x),y) -> f(x,g(x,y))
    f(0(),y) -> y
    g(x,y) -> y
   graph:
    f#(s(x),y) -> f#(x,g(x,y)) -> f#(s(x),y) -> f#(x,g(x,y))
    f#(s(x),y) -> f#(x,g(x,y)) -> f#(s(x),y) -> g#(x,y)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     f#(s(x),y) -> f#(x,g(x,y))
    TRS:
     f(s(x),y) -> f(x,g(x,y))
     f(0(),y) -> y
     g(x,y) -> y
    KBO Processor:
     argument filtering:
      pi(s) = [0]
      pi(f) = [0,1]
      pi(g) = [1]
      pi(0) = []
      pi(f#) = 0
     weight function:
      w0 = 1
      w(f#) = w(0) = w(f) = 1
      w(g) = w(s) = 0
     precedence:
      f# ~ 0 ~ g ~ f ~ s
     problem:
      DPs:
       
      TRS:
       f(s(x),y) -> f(x,g(x,y))
       f(0(),y) -> y
       g(x,y) -> y
     Qed