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