Input TRS:
    1: div(x,s(y)) -> d(x,s(y),0())
    2: d(x,s(y),z) -> cond(ge(x,z),x,y,z)
    3: cond(true(),x,y,z) -> s(d(x,s(y),plus(s(y),z)))
    4: cond(false(),x,y,z) -> 0()
    5: ge(u,0()) -> true()
    6: ge(0(),s(v)) -> false()
    7: ge(s(u),s(v)) -> ge(u,v)
    8: plus(n,0()) -> n
    9: plus(n,s(m)) -> s(plus(n,m))
Number of strict rules: 9
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #d(x,s(y),z) -> #cond(ge(x,z),x,y,z)
   #2: #d(x,s(y),z) -> #ge(x,z)
   #3: #plus(n,s(m)) -> #plus(n,m)
   #4: #ge(s(u),s(v)) -> #ge(u,v)
   #5: #cond(true(),x,y,z) -> #d(x,s(y),plus(s(y),z))
   #6: #cond(true(),x,y,z) -> #plus(s(y),z)
   #7: #div(x,s(y)) -> #d(x,s(y),0())
Number of SCCs: 3, DPs: 4, edges: 4
	SCC { #3 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
 #div(x1,x2)	weight: 0
     d(x1,x2,x3)	weight: 0
     s(x1)	weight: (/ 1 2) + x1
#plus(x1,x2)	weight: x2
 false()	weight: 0
   div(x1,x2)	weight: 0
  #ge(x1,x2)	weight: 0
  true()	weight: 0
#cond(x1,x2,x3,x4)	weight: 0
     0()	weight: 0
    ge(x1,x2)	weight: 0
   #d(x1,x2,x3)	weight: 0
  plus(x1,x2)	weight: 0
  cond(x1,x2,x3,x4)	weight: 0
    Usable rules: { }
    Removed DPs: #3
Number of SCCs: 2, DPs: 3, edges: 3
	SCC { #4 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
 #div(x1,x2)	weight: 0
     d(x1,x2,x3)	weight: 0
     s(x1)	weight: (/ 1 2) + x1
#plus(x1,x2)	weight: 0
 false()	weight: 0
   div(x1,x2)	weight: 0
  #ge(x1,x2)	weight: x2
  true()	weight: 0
#cond(x1,x2,x3,x4)	weight: 0
     0()	weight: 0
    ge(x1,x2)	weight: 0
   #d(x1,x2,x3)	weight: 0
  plus(x1,x2)	weight: 0
  cond(x1,x2,x3,x4)	weight: 0
    Usable rules: { }
    Removed DPs: #4
Number of SCCs: 1, DPs: 2, edges: 2
	SCC { #1 #5 }
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