Input TRS:
    1: f(s(x),x) -> f(s(x),round(x))
    2: round(0()) -> 0()
    3: round(0()) -> s(0())
    4: round(s(0())) -> s(0())
    5: round(s(s(x))) -> s(s(round(x)))
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing f
1: f❆1_s(x,x) -> f❆1_s(x,round(x))
2: round(0()) -> 0()
3: round(0()) -> s(0())
4: round(s(0())) -> s(0())
5: round(s(s(x))) -> s(s(round(x)))
6: f(s(_1),_2) ->= f❆1_s(_1,_2)
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... removes: 6
     s(x1)	weight: x1
f❆1_s(x1,x2)	weight: x1 + x2
     f(x1,x2)	weight: (/ 1 2) + x1 + x2
     0()	weight: 0
 round(x1)	weight: x1
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Dependency Pairs:
   #1: #round(s(s(x))) -> #round(x)
   #2: #f❆1_s(x,x) -> #f❆1_s(x,round(x))
   #3: #f❆1_s(x,x) -> #round(x)
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
#f❆1_s(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 4) + x1
f❆1_s(x1,x2)	weight: 0
     f(x1,x2)	weight: 0
     0()	weight: 0
 round(x1)	weight: 0
#round(x1)	weight: x1
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
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