YES

Problem:
 0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
 0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
 0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
 0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
 0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1))))))

Proof:
 DP Processor:
  DPs:
   0#(1(2(3(4(x1))))) -> 0#(2(1(3(4(x1)))))
   0#(5(1(2(4(3(x1)))))) -> 0#(5(2(1(4(3(x1))))))
   0#(5(2(4(1(3(x1)))))) -> 0#(1(5(2(4(3(x1))))))
   0#(5(3(1(2(4(x1)))))) -> 0#(1(5(3(2(4(x1))))))
   0#(5(4(1(3(2(x1)))))) -> 0#(5(4(3(1(2(x1))))))
  TRS:
   0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
   0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
   0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
   0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
   0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1))))))
  EDG Processor:
   DPs:
    0#(1(2(3(4(x1))))) -> 0#(2(1(3(4(x1)))))
    0#(5(1(2(4(3(x1)))))) -> 0#(5(2(1(4(3(x1))))))
    0#(5(2(4(1(3(x1)))))) -> 0#(1(5(2(4(3(x1))))))
    0#(5(3(1(2(4(x1)))))) -> 0#(1(5(3(2(4(x1))))))
    0#(5(4(1(3(2(x1)))))) -> 0#(5(4(3(1(2(x1))))))
   TRS:
    0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
    0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
    0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
    0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
    0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1))))))
   graph:
    
   Qed