YES
Input TRS:
      1: f(nil()) -> nil()
      2: f(.(nil(),y)) -> .(nil(),f(y))
      3: f(.(.(x,y),z)) -> f(.(x,.(y,z)))
      4: g(nil()) -> nil()
      5: g(.(x,nil())) -> .(g(x),nil())
      6: g(.(x,.(y,z))) -> g(.(.(x,y),z))
Number of strict rules: 6
Direct POLO(bPol) ... removes: 4 1 5
      f 	w: x1 + 1
      nil	w: 20538
      . 	w: x1 + x2 + 8946
      g 	w: 2 * x1 + 15922
Number of strict rules: 3
Direct POLO(bPol) ... removes: 2
      f 	w: 2 * x1 + 16908
      nil	w: 1
      . 	w: x1 + x2 + 1
      g 	w: x1 + 15922
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying f g
      3: f^1_.(.(x,y),z) -> f^1_.(x,.(y,z))
      6: g^1_.(x,.(y,z)) -> g^1_.(.(x,y),z)
      7: g(.(_1,_2)) ->= g^1_.(_1,_2)
      8: f(.(_1,_2)) ->= f^1_.(_1,_2)
Number of strict rules: 2
Direct POLO(bPol) ... removes: 8 7 6
      f 	w: x1 + 11797
      nil	w: 0
      . 	w: x1 + x2 + 1
      f^1_.	w: x1 + x2 + 11797
      g^1_.	w: x1 + 2 * x2
      g 	w: 2 * x1
Number of strict rules: 1
Direct POLO(bPol) ... removes: 3
      f 	w: 2 * x1 + 11797
      nil	w: 0
      . 	w: x1 + x2 + 1
      f^1_.	w: 2 * x1 + x2 + 11798
      g^1_.	w: x1 + 2 * x2
      g 	w: 2 * x1
Number of strict rules: 0