Input TRS:
    1: b(a(x)) -> a(b(x))
    2: a(x) ->= a(a(x))
    3: b(x) ->= b(b(x))
Number of strict rules: 1
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #b(x) ->? #b(b(x))
   #2: #b(x) ->? #b(x)
   #3: #b(a(x)) -> #b(x)
Number of SCCs: 1, DPs: 3, edges: 9
	SCC { #1..3 }
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.
  #b(a(x_{i9}))	-#1->
  #b(b(a(x_{i9})))	--->*
  #b(a(a(a(a(a(b(x_{i9})))))))	-#3->
  #b(a(a(a(a(b(x_{i9}))))))	--->*
  #b(a(a(a(a(b(x_{i9}))))))
  Looping with: [ x_{i9} := a(a(a(b(x_{i9})))); ]
NO