0.00/0.10 MAYBE 0.00/0.11 Input TRS: 0.00/0.11 1: a(x1) -> x1 0.00/0.11 2: b(x1) -> x1 0.00/0.11 3: a(c(x1)) -> b(b(c(a(x1)))) 0.00/0.11 4: d(b(b(b(x1)))) -> a(d(a(x1))) 0.00/0.11 5: a(b(x1)) ->= b(a(x1)) 0.00/0.11 6: b(a(x1)) ->= a(b(x1)) 0.00/0.11 Number of strict rules: 4 0.00/0.11 Direct POLO(bPol) ... failed. 0.00/0.11 Uncurrying ... failed. 0.00/0.11 Dependency Pairs: 0.00/0.11 #1: #b(a(x1)) ->? #a(b(x1)) 0.00/0.11 #2: #b(a(x1)) ->? #b(x1) 0.00/0.11 #3: #a(b(x1)) ->? #b(a(x1)) 0.00/0.11 #4: #a(b(x1)) ->? #a(x1) 0.00/0.11 #5: #a(c(x1)) -> #b(b(c(a(x1)))) 0.00/0.11 #6: #a(c(x1)) -> #b(c(a(x1))) 0.00/0.11 #7: #a(c(x1)) -> #a(x1) 0.00/0.11 #8: #d(b(b(b(x1)))) -> #a(d(a(x1))) 0.00/0.11 #9: #d(b(b(b(x1)))) -> #d(a(x1)) 0.00/0.11 #10: #d(b(b(b(x1)))) -> #a(x1) 0.00/0.11 Number of SCCs: 2, DPs: 7 0.00/0.11 SCC { #9 } 0.00/0.11 POLO(Sum)... succeeded. 0.00/0.11 a w: x1 + 2 0.00/0.11 d w: 0 0.00/0.11 b w: x1 + 1 0.00/0.11 c w: 1 0.00/0.11 #d w: x1 0.00/0.11 #a w: 0 0.00/0.11 #b w: 0 0.00/0.11 USABLE RULES: { 1..3 5 6 } 0.00/0.11 Removed DPs: #9 0.00/0.11 Number of SCCs: 1, DPs: 6 0.00/0.11 SCC { #1..5 #7 } 0.00/0.11 POLO(Sum)... succeeded. 0.00/0.11 a w: x1 + 1 0.00/0.11 d w: 0 0.00/0.11 b w: x1 0.00/0.11 c w: x1 + 1 0.00/0.11 #d w: x1 0.00/0.11 #a w: x1 + 1 0.00/0.11 #b w: x1 0.00/0.11 USABLE RULES: { 1..3 5 6 } 0.00/0.11 Removed DPs: #2 #7 0.00/0.11 Number of SCCs: 1, DPs: 4 0.00/0.11 SCC { #1 #3..5 } 0.00/0.11 POLO(Sum)... succeeded. 0.00/0.11 a w: x1 + 3 0.00/0.11 d w: 0 0.00/0.11 b w: x1 + 1 0.00/0.11 c w: 1 0.00/0.11 #d w: x1 0.00/0.11 #a w: x1 + 2 0.00/0.11 #b w: x1 0.00/0.11 USABLE RULES: { 1..3 5 6 } 0.00/0.11 Removed DPs: #4 #5 0.00/0.11 Number of SCCs: 1, DPs: 2 0.00/0.11 SCC { #1 #3 } 0.00/0.11 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.00/0.11 Finding a loop... failed. 0.00/0.11 EOF