YES

Problem:
 min(X,0()) -> X
 min(s(X),s(Y)) -> min(X,Y)
 quot(0(),s(Y)) -> 0()
 quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
 log(s(0())) -> 0()
 log(s(s(X))) -> s(log(s(quot(X,s(s(0()))))))

Proof:
 DP Processor:
  DPs:
   min#(s(X),s(Y)) -> min#(X,Y)
   quot#(s(X),s(Y)) -> min#(X,Y)
   quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y))
   log#(s(s(X))) -> quot#(X,s(s(0())))
   log#(s(s(X))) -> log#(s(quot(X,s(s(0())))))
  TRS:
   min(X,0()) -> X
   min(s(X),s(Y)) -> min(X,Y)
   quot(0(),s(Y)) -> 0()
   quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
   log(s(0())) -> 0()
   log(s(s(X))) -> s(log(s(quot(X,s(s(0()))))))
  Usable Rule Processor:
   DPs:
    min#(s(X),s(Y)) -> min#(X,Y)
    quot#(s(X),s(Y)) -> min#(X,Y)
    quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y))
    log#(s(s(X))) -> quot#(X,s(s(0())))
    log#(s(s(X))) -> log#(s(quot(X,s(s(0())))))
   TRS:
    min(X,0()) -> X
    min(s(X),s(Y)) -> min(X,Y)
    quot(0(),s(Y)) -> 0()
    quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
   KBO Processor:
    argument filtering:
     pi(0) = []
     pi(min) = 0
     pi(s) = [0]
     pi(quot) = 0
     pi(min#) = 0
     pi(quot#) = 0
     pi(log#) = 0
    usable rules:
     min(X,0()) -> X
     min(s(X),s(Y)) -> min(X,Y)
     quot(0(),s(Y)) -> 0()
     quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
    weight function:
     w0 = 1
     w(log#) = w(min) = w(0) = 1
     w(quot#) = w(min#) = w(quot) = w(s) = 0
    precedence:
     log# ~ quot# ~ min# ~ quot ~ s ~ min ~ 0
    problem:
     DPs:
      
     TRS:
      min(X,0()) -> X
      min(s(X),s(Y)) -> min(X,Y)
      quot(0(),s(Y)) -> 0()
      quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y)))
    Qed