Input TRS:
    1: le(0(),y) -> true()
    2: le(s(x),0()) -> false()
    3: le(s(x),s(y)) -> le(x,y)
    4: eq(0(),0()) -> true()
    5: eq(0(),s(y)) -> false()
    6: eq(s(x),0()) -> false()
    7: eq(s(x),s(y)) -> eq(x,y)
    8: if(true(),x,y) -> x
    9: if(false(),x,y) -> y
    10: minsort(nil()) -> nil()
    11: minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y))))
    12: min(x,nil()) -> x
    13: min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z))
    14: del(x,nil()) -> nil()
    15: del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z)))
Number of strict rules: 15
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #min(x,cons(y,z)) -> #if(le(x,y),min(x,z),min(y,z))
   #2: #min(x,cons(y,z)) -> #le(x,y)
   #3: #min(x,cons(y,z)) -> #min(x,z)
   #4: #min(x,cons(y,z)) -> #min(y,z)
   #5: #minsort(cons(x,y)) -> #min(x,y)
   #6: #minsort(cons(x,y)) -> #minsort(del(min(x,y),cons(x,y)))
   #7: #minsort(cons(x,y)) -> #del(min(x,y),cons(x,y))
   #8: #minsort(cons(x,y)) -> #min(x,y)
   #9: #eq(s(x),s(y)) -> #eq(x,y)
   #10: #le(s(x),s(y)) -> #le(x,y)
   #11: #del(x,cons(y,z)) -> #if(eq(x,y),z,cons(y,del(x,z)))
   #12: #del(x,cons(y,z)) -> #eq(x,y)
   #13: #del(x,cons(y,z)) -> #del(x,z)
Number of SCCs: 5, DPs: 6, edges: 8
	SCC { #10 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
    le(x1,x2)	weight: 0
 #del(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 2) + x1
  #le(x1,x2)	weight: x2
    eq(x1,x2)	weight: 0
 false()	weight: 0
 #min(x1,x2)	weight: 0
  true()	weight: 0
  #eq(x1,x2)	weight: 0
     0()	weight: 0
    if(x1,x2,x3)	weight: 0
   del(x1,x2)	weight: 0
   nil()	weight: 0
   min(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
  #if(x1,x2,x3)	weight: 0
#minsort(x1)	weight: 0
minsort(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #10
Number of SCCs: 4, DPs: 5, edges: 7
	SCC { #9 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
    le(x1,x2)	weight: 0
 #del(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 2) + x1
  #le(x1,x2)	weight: 0
    eq(x1,x2)	weight: 0
 false()	weight: 0
 #min(x1,x2)	weight: 0
  true()	weight: 0
  #eq(x1,x2)	weight: x2
     0()	weight: 0
    if(x1,x2,x3)	weight: 0
   del(x1,x2)	weight: 0
   nil()	weight: 0
   min(x1,x2)	weight: 0
  cons(x1,x2)	weight: 0
  #if(x1,x2,x3)	weight: 0
#minsort(x1)	weight: 0
minsort(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #9
Number of SCCs: 3, DPs: 4, edges: 6
	SCC { #13 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
    le(x1,x2)	weight: 0
 #del(x1,x2)	weight: x2
     s(x1)	weight: (/ 1 2)
  #le(x1,x2)	weight: 0
    eq(x1,x2)	weight: 0
 false()	weight: 0
 #min(x1,x2)	weight: 0
  true()	weight: 0
  #eq(x1,x2)	weight: 0
     0()	weight: 0
    if(x1,x2,x3)	weight: 0
   del(x1,x2)	weight: 0
   nil()	weight: 0
   min(x1,x2)	weight: 0
  cons(x1,x2)	weight: (/ 1 2) + x2
  #if(x1,x2,x3)	weight: 0
#minsort(x1)	weight: 0
minsort(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #13
Number of SCCs: 2, DPs: 3, edges: 5
	SCC { #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