Input TRS:
    1: f(0()) -> cons(0(),f(s(0())))
    2: f(s(0())) -> f(p(s(0())))
    3: p(s(0())) -> 0()
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing f p❆1_s p
1: f❆1_0() -> cons(0(),f❆1_s(0()))
2: f❆1_s(0()) -> f(p❆1_s❆1_0())
3: p❆1_s❆1_0() -> 0()
4: p(s(_1)) ->= p❆1_s(_1)
5: p❆1_s(0()) ->= p❆1_s❆1_0()
6: f(0()) ->= f❆1_0()
7: f(s(_1)) ->= f❆1_s(_1)
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... removes: 4 5 7
     s(x1)	weight: (/ 1 4) + x1
p❆1_s(x1)	weight: (/ 1 4) + x1
p❆1_s❆1_0()	weight: 0
f❆1_s(x1)	weight: x1
     f(x1)	weight: 2 * x1
     p(x1)	weight: (/ 1 4) + x1
     0()	weight: 0
  cons(x1,x2)	weight: x1 + x2
f❆1_0()	weight: 0
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Dependency Pairs:
   #1: #f❆1_s(0()) -> #f(p❆1_s❆1_0())
   #2: #f❆1_s(0()) -> #p❆1_s❆1_0()
   #3: #f(0()) ->? #f❆1_0()
   #4: #f❆1_0() -> #f❆1_s(0())
Number of SCCs: 1, DPs: 3, edges: 3
	SCC { #1 #3 #4 }
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...  found.
  #f❆1_0()	-#4->
  #f❆1_s(0())	--->*
  #f❆1_s(0())	-#1->
  #f(p❆1_s❆1_0())	--->*
  #f(0())	-#3->
  #f❆1_0()	--->*
  #f❆1_0()
  Looping with: [ ]
NO