MAYBE
Input TRS:
      1: log(x,s(s(y))) -> cond(le(x,s(s(y))),x,y)
      2: cond(true(),x,y) -> s(0())
      3: cond(false(),x,y) -> double(log(x,square(s(s(y)))))
      4: le(0(),v) -> true()
      5: le(s(u),0()) -> false()
      6: le(s(u),s(v)) -> le(u,v)
      7: double(0()) -> 0()
      8: double(s(x)) -> s(s(double(x)))
      9: square(0()) -> 0()
      10: square(s(x)) -> s(plus(square(x),double(x)))
      11: plus(n,0()) -> n
      12: plus(n,s(m)) -> s(plus(n,m))
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying square
      1: log(x,s(s(y))) -> cond(le(x,s(s(y))),x,y)
      2: cond(true(),x,y) -> s(0())
      3: cond(false(),x,y) -> double(log(x,square^1_s(s(y))))
      4: le(0(),v) -> true()
      5: le(s(u),0()) -> false()
      6: le(s(u),s(v)) -> le(u,v)
      7: double(0()) -> 0()
      8: double(s(x)) -> s(s(double(x)))
      9: square^1_0() -> 0()
      10: square^1_s(x) -> s(plus(square(x),double(x)))
      11: plus(n,0()) -> n
      12: plus(n,s(m)) -> s(plus(n,m))
      13: square(0()) ->= square^1_0()
      14: square(s(_1)) ->= square^1_s(_1)
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #le(s(u),s(v)) -> #le(u,v)
     #2: #square(0()) ->? #square^1_0()
     #3: #plus(n,s(m)) -> #plus(n,m)
     #4: #square(s(_1)) ->? #square^1_s(_1)
     #5: #square^1_s(x) -> #plus(square(x),double(x))
     #6: #square^1_s(x) -> #square(x)
     #7: #square^1_s(x) -> #double(x)
     #8: #cond(false(),x,y) -> #double(log(x,square^1_s(s(y))))
     #9: #cond(false(),x,y) -> #log(x,square^1_s(s(y)))
     #10: #cond(false(),x,y) -> #square^1_s(s(y))
     #11: #log(x,s(s(y))) -> #cond(le(x,s(s(y))),x,y)
     #12: #log(x,s(s(y))) -> #le(x,s(s(y)))
     #13: #double(s(x)) -> #double(x)
Number of SCCs: 5, DPs: 7
  SCC { #13 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      square^1_0	w: 0
      #plus	w: 0
      #square^1_s	w: 0
      square	w: 0
      false	w: 0
      #log	w: 0
      #square	w: 0
      true	w: 0
      #square^1_0	w: 0
      log	w: 0
      #cond	w: 0
      0 	w: 0
      #double	w: x1
      double	w: 0
      square^1_s	w: 0
      plus	w: 0
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 4, DPs: 6
  SCC { #3 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      square^1_0	w: 0
      #plus	w: x2
      #square^1_s	w: 0
      square	w: 0
      false	w: 0
      #log	w: 0
      #square	w: 0
      true	w: 0
      #square^1_0	w: 0
      log	w: 0
      #cond	w: 0
      0 	w: 0
      #double	w: 0
      double	w: 0
      square^1_s	w: 0
      plus	w: 0
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 3, DPs: 5
  SCC { #1 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: x1 + x2
      square^1_0	w: 0
      #plus	w: 0
      #square^1_s	w: 0
      square	w: 0
      false	w: 0
      #log	w: 0
      #square	w: 0
      true	w: 0
      #square^1_0	w: 0
      log	w: 0
      #cond	w: 0
      0 	w: 0
      #double	w: 0
      double	w: 0
      square^1_s	w: 0
      plus	w: 0
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 4
  SCC { #4 #6 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 2
      #le	w: 0
      square^1_0	w: 0
      #plus	w: 0
      #square^1_s	w: x1 + 1
      square	w: 0
      false	w: 0
      #log	w: 0
      #square	w: x1
      true	w: 0
      #square^1_0	w: 0
      log	w: 0
      #cond	w: 0
      0 	w: 0
      #double	w: 0
      double	w: 0
      square^1_s	w: 0
      plus	w: 0
      cond	w: 0
    USABLE RULES: { }
    Removed DPs: #4 #6
Number of SCCs: 1, DPs: 2
  SCC { #9 #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.