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