MAYBE
Input TRS:
      1: f(true(),x,y,z) -> f(and(gt(x,y),gt(x,z)),x,s(y),z)
      2: f(true(),x,y,z) -> f(and(gt(x,y),gt(x,z)),x,y,s(z))
      3: gt(0(),v) -> false()
      4: gt(s(u),0()) -> true()
      5: gt(s(u),s(v)) -> gt(u,v)
      6: and(x,true()) -> x
      7: and(x,false()) -> false()
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(true(),x,y,z) -> #f(and(gt(x,y),gt(x,z)),x,y,s(z))
     #2: #f(true(),x,y,z) -> #and(gt(x,y),gt(x,z))
     #3: #f(true(),x,y,z) -> #gt(x,y)
     #4: #f(true(),x,y,z) -> #gt(x,z)
     #5: #gt(s(u),s(v)) -> #gt(u,v)
     #6: #f(true(),x,y,z) -> #f(and(gt(x,y),gt(x,z)),x,s(y),z)
     #7: #f(true(),x,y,z) -> #and(gt(x,y),gt(x,z))
     #8: #f(true(),x,y,z) -> #gt(x,y)
     #9: #f(true(),x,y,z) -> #gt(x,z)
Number of SCCs: 2, DPs: 3
  SCC { #5 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gt	w: 0
      and	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      #gt	w: x1 + x2
      #f 	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 1, DPs: 2
  SCC { #1 #6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.