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