YES
Input TRS:
      1: admit(x,nil()) -> nil()
      2: admit(x,.(u,.(v,.(w(),z)))) -> cond(=(sum(x,u,v),w()),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
      3: cond(true(),y) -> y
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying cond
      1: admit(x,nil()) -> nil()
      2: admit(x,.(u,.(v,.(w(),z)))) -> cond^1_=(sum(x,u,v),w(),.(u,.(v,.(w(),admit(carry(x,u,v),z)))))
      3: cond^1_true(y) -> y
      4: cond(=(_1,_2),_3) ->= cond^1_=(_1,_2,_3)
      5: cond(true(),_1) ->= cond^1_true(_1)
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #admit(x,.(u,.(v,.(w(),z)))) -> #admit(carry(x,u,v),z)
     #2: #cond(true(),_1) ->? #cond^1_true(_1)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      admit	w: 0
      w 	w: 1
      cond^1_=	w: 0
      #cond^1_true	w: 0
      true	w: 0
      sum	w: 0
      cond^1_true	w: 0
      #cond	w: 0
      = 	w: 0
      nil	w: 0
      . 	w: x2 + 28958
      #admit	w: x1 + x2
      carry	w: 1
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0