Input TRS:
    1: f(act(),y) -> f(el(nact()),y)
    2: f(x,nact()) -> f(x,act())
    3: act() -> el(nact())
    4: l(el(x)) -> el(l(x))
    5: el(r(x)) -> r(el(x))
    6: nact() ->= l(nact())
    7: nact() ->= r(nact())
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(x,nact()) -> #f(x,act())
   #2: #f(x,nact()) -> #act()
   #3: #nact() ->? #l(nact())
   #4: #nact() ->? #nact()
   #5: #nact() ->? #nact()
   #6: #el(r(x)) -> #el(x)
   #7: #act() -> #el(nact())
   #8: #act() -> #nact()
   #9: #f(act(),y) -> #f(el(nact()),y)
   #10: #f(act(),y) -> #el(nact())
   #11: #f(act(),y) -> #nact()
   #12: #l(el(x)) -> #el(l(x))
   #13: #l(el(x)) -> #l(x)
Number of SCCs: 4, DPs: 6, edges: 8
	SCC { #4 #5 }
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