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