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