YES
Input TRS:
      1: ap(ap(ff(),x),x) -> ap(ap(x,ap(ff(),x)),ap(ap(cons(),x),nil()))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ap
      1: ap^2_ff(x,x) -> ap(ap(x,ap^1_ff(x)),ap^2_cons(x,nil()))
      2: ap(cons(),_1) ->= ap^1_cons(_1)
      3: ap(ap^1_cons(_1),_2) ->= ap^2_cons(_1,_2)
      4: ap(ff(),_1) ->= ap^1_ff(_1)
      5: ap(ap^1_ff(_1),_2) ->= ap^2_ff(_1,_2)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #ap(ap^1_ff(_1),_2) ->? #ap^2_ff(_1,_2)
     #2: #ap^2_ff(x,x) -> #ap(ap(x,ap^1_ff(x)),ap^2_cons(x,nil()))
     #3: #ap^2_ff(x,x) -> #ap(x,ap^1_ff(x))
Number of SCCs: 1, DPs: 3
  SCC { #1..3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      ap^2_cons	w: 0
      ap	w: max(x1 - 26289, x2 - 26288, 0)
      ff	w: 35235
      #ap^2_ff	w: max(x2 + 26287, 0)
      nil	w: 0
      ap^1_ff	w: 1
      #ap	w: max(x1 + x2 + 26286, 0)
      cons	w: 70256
      ap^2_ff	w: max(x2 - 52578, 0)
      ap^1_cons	w: 43967
    USABLE RULES: { 1..5 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #1 #3 }
POLO(Sum)... succeeded.
      ap^2_cons	w: 0
      ap	w: x1 + x2
      ff	w: 283
      #ap^2_ff	w: x1 + 1
      nil	w: 1
      ap^1_ff	w: x1 + 283
      #ap	w: x1
      cons	w: 1
      ap^2_ff	w: x1 + x2 + 283
      ap^1_cons	w: x1 + 1
    USABLE RULES: { 1..5 }
    Removed DPs: #1 #3
Number of SCCs: 0, DPs: 0