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 Order(PosReal,>,Poly) ... failed.
Freezing ... 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, edges: 5
	SCC { #5 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 2) + x1
    gt(x1,x2)	weight: 0
   and(x1,x2)	weight: 0
 false()	weight: 0
  true()	weight: 0
     f(x1,x2,x3,x4)	weight: 0
     0()	weight: 0
  #gt(x1,x2)	weight: x2
   #f(x1,x2,x3,x4)	weight: 0
 #and(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #5
Number of SCCs: 1, DPs: 2, edges: 4
	SCC { #1 #6 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE