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