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