YES

Problem:
 rev(nil()) -> nil()
 rev(cons(x,l)) -> cons(rev1(x,l),rev2(x,l))
 rev1(0(),nil()) -> 0()
 rev1(s(x),nil()) -> s(x)
 rev1(x,cons(y,l)) -> rev1(y,l)
 rev2(x,nil()) -> nil()
 rev2(x,cons(y,l)) -> rev(cons(x,rev2(y,l)))

Proof:
 DP Processor:
  DPs:
   rev#(cons(x,l)) -> rev2#(x,l)
   rev#(cons(x,l)) -> rev1#(x,l)
   rev1#(x,cons(y,l)) -> rev1#(y,l)
   rev2#(x,cons(y,l)) -> rev2#(y,l)
   rev2#(x,cons(y,l)) -> rev#(cons(x,rev2(y,l)))
  TRS:
   rev(nil()) -> nil()
   rev(cons(x,l)) -> cons(rev1(x,l),rev2(x,l))
   rev1(0(),nil()) -> 0()
   rev1(s(x),nil()) -> s(x)
   rev1(x,cons(y,l)) -> rev1(y,l)
   rev2(x,nil()) -> nil()
   rev2(x,cons(y,l)) -> rev(cons(x,rev2(y,l)))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [rev1#](x0, x1) = 1/2x1,
    
    [rev2#](x0, x1) = x1 + 1/2,
    
    [rev#](x0) = x0,
    
    [s](x0) = 0,
    
    [0] = 0,
    
    [rev2](x0, x1) = x1,
    
    [rev1](x0, x1) = 0,
    
    [cons](x0, x1) = 2x1 + 1,
    
    [rev](x0) = x0,
    
    [nil] = 0
   orientation:
    rev#(cons(x,l)) = 2l + 1 >= l + 1/2 = rev2#(x,l)
    
    rev#(cons(x,l)) = 2l + 1 >= 1/2l = rev1#(x,l)
    
    rev1#(x,cons(y,l)) = l + 1/2 >= 1/2l = rev1#(y,l)
    
    rev2#(x,cons(y,l)) = 2l + 3/2 >= l + 1/2 = rev2#(y,l)
    
    rev2#(x,cons(y,l)) = 2l + 3/2 >= 2l + 1 = rev#(cons(x,rev2(y,l)))
    
    rev(nil()) = 0 >= 0 = nil()
    
    rev(cons(x,l)) = 2l + 1 >= 2l + 1 = cons(rev1(x,l),rev2(x,l))
    
    rev1(0(),nil()) = 0 >= 0 = 0()
    
    rev1(s(x),nil()) = 0 >= 0 = s(x)
    
    rev1(x,cons(y,l)) = 0 >= 0 = rev1(y,l)
    
    rev2(x,nil()) = 0 >= 0 = nil()
    
    rev2(x,cons(y,l)) = 2l + 1 >= 2l + 1 = rev(cons(x,rev2(y,l)))
   problem:
    DPs:
     
    TRS:
     rev(nil()) -> nil()
     rev(cons(x,l)) -> cons(rev1(x,l),rev2(x,l))
     rev1(0(),nil()) -> 0()
     rev1(s(x),nil()) -> s(x)
     rev1(x,cons(y,l)) -> rev1(y,l)
     rev2(x,nil()) -> nil()
     rev2(x,cons(y,l)) -> rev(cons(x,rev2(y,l)))
   Qed