MAYBE
Input TRS:
AC symbols: plus times
      1: 0(S()) -> S()
      2: plus(S(),x) -> x
      3: plus(0(x),0(y)) -> 0(plus(x,y))
      4: plus(0(x),1(y)) -> 1(plus(x,y))
      5: plus(1(x),1(y)) -> 0(plus(x,plus(y,1(S()))))
      6: times(S(),x) -> S()
      7: times(0(x),y) -> 0(times(x,y))
      8: times(1(x),y) -> plus(0(times(x,y)),y)
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z)
     #2: #plus(x,plus(y,z)) ->= #plus(x,y)
     #3: #times(0(x),y) -> #0(times(x,y))
     #4: #times(0(x),y) -> #times(x,y)
     #5: #times(x,times(y,z)) ->= #times(times(x,y),z)
     #6: #times(x,times(y,z)) ->= #times(x,y)
     #7: #plus(1(x),1(y)) -> #0(plus(x,plus(y,1(S()))))
     #8: #plus(1(x),1(y)) -> #plus(x,plus(y,1(S())))
     #9: #plus(1(x),1(y)) -> #plus(y,1(S()))
     #10: #plus(0(x),0(y)) -> #0(plus(x,y))
     #11: #plus(0(x),0(y)) -> #plus(x,y)
     #12: #times(1(x),y) -> #plus(0(times(x,y)),y)
     #13: #times(1(x),y) -> #0(times(x,y))
     #14: #times(1(x),y) -> #times(x,y)
     #15: #plus(0(x),1(y)) -> #plus(x,y)
Number of SCCs: 2, DPs: 10
  SCC { #4..6 #14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      #0 	w: max(x1 - 1, 0)
      1 	w: max(x1, 0)
      S 	w: 0
      #plus	w: 0
      #times	w: max(x1 + x2 + 1, 0)
      0 	w: max(x1, 0)
      times	w: max(x1 + x2 + 39, 0)
      plus	w: max(x1, x2, 0)
    USABLE RULES: { 1..10 }
    Removed DPs: #6
Number of SCCs: 2, DPs: 9
  SCC { #4 #5 #14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.