Input TRS:
    1: active(2nd(cons(X,cons(Y,Z)))) -> mark(Y)
    2: active(from(X)) -> mark(cons(X,from(s(X))))
    3: mark(2nd(X)) -> active(2nd(mark(X)))
    4: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    5: mark(from(X)) -> active(from(mark(X)))
    6: mark(s(X)) -> active(s(mark(X)))
    7: 2nd(mark(X)) -> 2nd(X)
    8: 2nd(active(X)) -> 2nd(X)
    9: cons(mark(X1),X2) -> cons(X1,X2)
    10: cons(X1,mark(X2)) -> cons(X1,X2)
    11: cons(active(X1),X2) -> cons(X1,X2)
    12: cons(X1,active(X2)) -> cons(X1,X2)
    13: from(mark(X)) -> from(X)
    14: from(active(X)) -> from(X)
    15: s(mark(X)) -> s(X)
    16: s(active(X)) -> s(X)
Number of strict rules: 16
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(from(X)) -> #mark(cons(X,from(s(X))))
   #2: #active(from(X)) -> #cons(X,from(s(X)))
   #3: #active(from(X)) -> #from(s(X))
   #4: #active(from(X)) -> #s(X)
   #5: #mark(s(X)) -> #active(s(mark(X)))
   #6: #mark(s(X)) -> #s(mark(X))
   #7: #mark(s(X)) -> #mark(X)
   #8: #from(mark(X)) -> #from(X)
   #9: #cons(mark(X1),X2) -> #cons(X1,X2)
   #10: #cons(active(X1),X2) -> #cons(X1,X2)
   #11: #cons(X1,active(X2)) -> #cons(X1,X2)
   #12: #from(active(X)) -> #from(X)
   #13: #2nd(mark(X)) -> #2nd(X)
   #14: #cons(X1,mark(X2)) -> #cons(X1,X2)
   #15: #mark(from(X)) -> #active(from(mark(X)))
   #16: #mark(from(X)) -> #from(mark(X))
   #17: #mark(from(X)) -> #mark(X)
   #18: #s(active(X)) -> #s(X)
   #19: #mark(2nd(X)) -> #active(2nd(mark(X)))
   #20: #mark(2nd(X)) -> #2nd(mark(X))
   #21: #mark(2nd(X)) -> #mark(X)
   #22: #active(2nd(cons(X,cons(Y,Z)))) -> #mark(Y)
   #23: #2nd(active(X)) -> #2nd(X)
   #24: #s(mark(X)) -> #s(X)
   #25: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2))
   #26: #mark(cons(X1,X2)) -> #cons(mark(X1),X2)
   #27: #mark(cons(X1,X2)) -> #mark(X1)
Number of SCCs: 5, DPs: 18, edges: 61
	SCC { #13 #23 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
   2nd(x1)	weight: 0
#mark(x1)	weight: 0
  from(x1)	weight: 0
   #s(x1)	weight: 0
 #2nd(x1)	weight: x1
  mark(x1)	weight: (/ 1 2) + x1
#from(x1)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #13 #23
Number of SCCs: 4, DPs: 16, edges: 57
	SCC { #8 #12 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
   2nd(x1)	weight: 0
#mark(x1)	weight: 0
  from(x1)	weight: 0
   #s(x1)	weight: 0
 #2nd(x1)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#from(x1)	weight: x1
active(x1)	weight: (/ 1 2) + x1
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #8 #12
Number of SCCs: 3, DPs: 14, edges: 53
	SCC { #18 #24 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: 0
   2nd(x1)	weight: 0
#mark(x1)	weight: 0
  from(x1)	weight: 0
   #s(x1)	weight: x1
 #2nd(x1)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#from(x1)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #18 #24
Number of SCCs: 2, DPs: 12, edges: 49
	SCC { #9..11 #14 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: x2
     s(x1)	weight: 0
   2nd(x1)	weight: 0
#mark(x1)	weight: 0
  from(x1)	weight: 0
   #s(x1)	weight: 0
 #2nd(x1)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#from(x1)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #11 #14
Number of SCCs: 2, DPs: 10, edges: 37
	SCC { #9 #10 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: x1
     s(x1)	weight: 0
   2nd(x1)	weight: 0
#mark(x1)	weight: 0
  from(x1)	weight: 0
   #s(x1)	weight: 0
 #2nd(x1)	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
#from(x1)	weight: 0
active(x1)	weight: (/ 1 2) + x1
  cons(x1,x2)	weight: 0
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #9 #10
Number of SCCs: 1, DPs: 8, edges: 33
	SCC { #1 #7 #15 #17 #19 #21 #22 #27 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: x1
   2nd(x1)	weight: (/ 1 4) + x1
#mark(x1)	weight: x1
  from(x1)	weight: (/ 1 2) + x1
   #s(x1)	weight: 0
 #2nd(x1)	weight: 0
  mark(x1)	weight: x1
#from(x1)	weight: 0
active(x1)	weight: x1
  cons(x1,x2)	weight: max{x2, (/ 1 4) + x1}
#active(x1)	weight: x1
    Usable rules: { 1..16 }
    Removed DPs: #17 #21 #22 #27
Number of SCCs: 2, DPs: 1, edges: 1
	SCC { #7 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#cons(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 4) + x1
   2nd(x1)	weight: (/ 1 4)
#mark(x1)	weight: (/ 1 4) + x1
  from(x1)	weight: (/ 1 2)
   #s(x1)	weight: 0
 #2nd(x1)	weight: 0
  mark(x1)	weight: (/ 1 4)
#from(x1)	weight: 0
active(x1)	weight: 0
  cons(x1,x2)	weight: (/ 1 4)
#active(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 0, edges: 0
YES