YES

Problem:
 +(-(x,y),z) -> -(+(x,z),y)
 -(+(x,y),y) -> x

Proof:
 DP Processor:
  DPs:
   +#(-(x,y),z) -> +#(x,z)
   +#(-(x,y),z) -> -#(+(x,z),y)
  TRS:
   +(-(x,y),z) -> -(+(x,z),y)
   -(+(x,y),y) -> x
  TDG Processor:
   DPs:
    +#(-(x,y),z) -> +#(x,z)
    +#(-(x,y),z) -> -#(+(x,z),y)
   TRS:
    +(-(x,y),z) -> -(+(x,z),y)
    -(+(x,y),y) -> x
   graph:
    +#(-(x,y),z) -> +#(x,z) -> +#(-(x,y),z) -> -#(+(x,z),y)
    +#(-(x,y),z) -> +#(x,z) -> +#(-(x,y),z) -> +#(x,z)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     +#(-(x,y),z) -> +#(x,z)
    TRS:
     +(-(x,y),z) -> -(+(x,z),y)
     -(+(x,y),y) -> x
    Subterm Criterion Processor:
     simple projection:
      pi(+#) = 0
     problem:
      DPs:
       
      TRS:
       +(-(x,y),z) -> -(+(x,z),y)
       -(+(x,y),y) -> x
     Qed