Input TRS:
    1: top(free(x)) -> top(check(new(x)))
    2: new(free(x)) -> free(new(x))
    3: old(free(x)) -> free(old(x))
    4: new(serve()) -> free(serve())
    5: old(serve()) -> free(serve())
    6: check(free(x)) -> free(check(x))
    7: check(new(x)) -> new(check(x))
    8: check(old(x)) -> old(check(x))
    9: check(old(x)) -> old(x)
Number of strict rules: 9
Direct Order(PosReal,>,Poly) ... removes: 5
   new(x1)	weight: (/ 1 8) + x1
   top(x1)	weight: 2 * x1
 serve()	weight: 0
  free(x1)	weight: (/ 1 8) + x1
 check(x1)	weight: x1
   old(x1)	weight: (/ 1 4) + x1
Number of strict rules: 8
Direct Order(PosReal,>,Poly) ... removes: 3
   new(x1)	weight: 15922 + x1
   top(x1)	weight: x1
 serve()	weight: 0
  free(x1)	weight: 15922 + x1
 check(x1)	weight: x1
   old(x1)	weight: (/ 31843 2) + 2 * x1
Number of strict rules: 7
Direct Order(PosReal,>,Poly) ... removes: 8 9
   new(x1)	weight: x1
   top(x1)	weight: x1
 serve()	weight: 0
  free(x1)	weight: 2 * x1
 check(x1)	weight: 2 * x1
   old(x1)	weight: (/ 1 4) + x1
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #new(free(x)) -> #new(x)
   #2: #check(free(x)) -> #check(x)
   #3: #check(new(x)) -> #new(check(x))
   #4: #check(new(x)) -> #check(x)
   #5: #top(free(x)) -> #top(check(new(x)))
   #6: #top(free(x)) -> #check(new(x))
   #7: #top(free(x)) -> #new(x)
Number of SCCs: 3, DPs: 4, edges: 6
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   new(x1)	weight: 0
   top(x1)	weight: 0
#check(x1)	weight: 0
 #top(x1)	weight: 0
 serve()	weight: 0
  free(x1)	weight: (/ 1 2) + x1
 check(x1)	weight: 0
 #new(x1)	weight: x1
   old(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 3, edges: 5
	SCC { #5 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... succeeded.
   new(x1)	weight: (/ 1 4) + x1_1 + x1_2; x1_2
   top(x1)	weight: 0; 0
#check(x1)	weight: 0; 0
 #top(x1)	weight: x1_1 + x1_2; x1_2
 serve()	weight: (/ 1 4); (/ 1 4)
  free(x1)	weight: (/ 1 2) + x1_1; x1_2
 check(x1)	weight: x1_1; 0
 #new(x1)	weight: 0; 0
   old(x1)	weight: 0; 0
    Usable rules: { 2 4 6 7 }
    Removed DPs: #5
Number of SCCs: 1, DPs: 2, edges: 4
	SCC { #2 #4 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   new(x1)	weight: (/ 1 2) + x1
   top(x1)	weight: 0
#check(x1)	weight: x1
 #top(x1)	weight: 0
 serve()	weight: 0
  free(x1)	weight: (/ 1 2) + x1
 check(x1)	weight: (/ 1 2)
 #new(x1)	weight: 0
   old(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #2 #4
Number of SCCs: 0, DPs: 0, edges: 0
YES