0.00/0.03 YES 0.00/0.03 Input TRS: 0.00/0.03 1: a(c(a(x1))) -> a(b(b(x1))) 0.00/0.03 2: a(c(a(x1))) -> a(c(b(x1))) 0.00/0.03 3: a(c(c(x1))) -> b(b(c(x1))) 0.00/0.03 4: b(c(a(x1))) -> c(b(a(x1))) 0.00/0.03 5: c(b(c(x1))) ->= b(c(c(x1))) 0.00/0.03 6: b(b(b(x1))) ->= c(a(c(x1))) 0.00/0.03 Number of strict rules: 4 0.00/0.03 Direct POLO(bPol) ... removes: 1 3 6 2 0.00/0.03 a w: x1 + 6 0.00/0.03 b w: x1 + 3 0.00/0.03 c w: x1 + 1 0.00/0.03 Number of strict rules: 1 0.00/0.03 Direct POLO(bPol) ... failed. 0.00/0.03 Uncurrying ... failed. 0.00/0.03 Dependency Pairs: 0.00/0.03 #1: #c(b(c(x1))) ->? #b(c(c(x1))) 0.00/0.03 #2: #c(b(c(x1))) ->? #c(c(x1)) 0.00/0.03 #3: #b(c(a(x1))) -> #c(b(a(x1))) 0.00/0.03 #4: #b(c(a(x1))) -> #b(a(x1)) 0.00/0.03 Number of SCCs: 1, DPs: 1 0.00/0.03 SCC { #2 } 0.00/0.03 POLO(Sum)... succeeded. 0.00/0.03 a w: 1 0.00/0.03 b w: x1 + 1 0.00/0.03 c w: x1 + 1 0.00/0.03 #c w: x1 0.00/0.03 #b w: 0 0.00/0.03 USABLE RULES: { 4 5 } 0.00/0.03 Removed DPs: #2 0.00/0.03 Number of SCCs: 0, DPs: 0 0.00/0.04 EOF