MAYBE
Input TRS:
      1: f(tt(),x) -> f(eq(toOne(x),s(0())),s(x))
      2: eq(s(x),s(y)) -> eq(x,y)
      3: eq(0(),0()) -> tt()
      4: toOne(s(s(x))) -> toOne(s(x))
      5: toOne(s(0())) -> s(0())
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying toOne
      1: f(tt(),x) -> f(eq(toOne(x),s(0())),s(x))
      2: eq(s(x),s(y)) -> eq(x,y)
      3: eq(0(),0()) -> tt()
      4: toOne^1_s(s(x)) -> toOne^1_s(x)
      5: toOne^1_s(0()) -> s(0())
      6: toOne(s(_1)) ->= toOne^1_s(_1)
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #eq(s(x),s(y)) -> #eq(x,y)
     #2: #toOne(s(_1)) ->? #toOne^1_s(_1)
     #3: #f(tt(),x) -> #f(eq(toOne(x),s(0())),s(x))
     #4: #f(tt(),x) -> #eq(toOne(x),s(0()))
     #5: #f(tt(),x) -> #toOne(x)
     #6: #toOne^1_s(s(x)) -> #toOne^1_s(x)
Number of SCCs: 3, DPs: 3
  SCC { #6 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      toOne	w: 0
      eq	w: 0
      #toOne^1_s	w: x1
      f 	w: 0
      #eq	w: 0
      0 	w: 0
      #f 	w: 0
      toOne^1_s	w: 0
      tt	w: 0
      #toOne	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 2
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      toOne	w: 0
      eq	w: 0
      #toOne^1_s	w: 0
      f 	w: 0
      #eq	w: x2
      0 	w: 0
      #f 	w: 0
      toOne^1_s	w: 0
      tt	w: 0
      #toOne	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.