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