Input TRS:
    1: f(cons(nil(),y)) -> y
    2: f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z)
    3: copy(0(),y,z) -> f(z)
    4: copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing copy
1: f(cons(nil(),y)) -> y
2: f(cons(f(cons(nil(),y)),z)) -> copy❆1_n(y,z)
3: copy❆1_0(y,z) -> f(z)
4: copy❆1_s(x,y,z) -> copy(x,y,cons(f(y),z))
5: copy(0(),_2,_3) ->= copy❆1_0(_2,_3)
6: copy(s(_1),_3,_4) ->= copy❆1_s(_1,_3,_4)
7: copy(n(),_2,_3) ->= copy❆1_n(_2,_3)
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Dependency Pairs:
   #1: #copy(s(_1),_3,_4) ->? #copy❆1_s(_1,_3,_4)
   #2: #copy(0(),_2,_3) ->? #copy❆1_0(_2,_3)
   #3: #copy❆1_0(y,z) -> #f(z)
   #4: #copy❆1_s(x,y,z) -> #copy(x,y,cons(f(y),z))
   #5: #copy❆1_s(x,y,z) -> #f(y)
Number of SCCs: 1, DPs: 2, edges: 2
	SCC { #1 #4 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#copy❆1_s(x1,x2,x3)	weight: (/ 1 4) + x1
     s(x1)	weight: (/ 1 2) + x1
     n()	weight: 0
#copy(x1,x2,x3)	weight: x1
copy❆1_s(x1,x2,x3)	weight: 0
     f(x1)	weight: 0
copy❆1_n(x1,x2)	weight: 0
     0()	weight: 0
   nil()	weight: 0
   #f(x1)	weight: 0
#copy❆1_0(x1,x2)	weight: 0
copy❆1_0(x1,x2)	weight: 0
  cons(x1,x2)	weight: (/ 1 4) + x2
  copy(x1,x2,x3)	weight: 0
    Usable rules: { 2 }
    Removed DPs: #1 #4
Number of SCCs: 0, DPs: 0, edges: 0
YES