0.00/0.05 MAYBE 0.00/0.05 Input TRS: 0.00/0.05 1: a(b(c(x1))) -> c(x1) 0.00/0.05 2: c(x1) ->= c(b(a(x1))) 0.00/0.05 Number of strict rules: 1 0.00/0.05 Direct POLO(bPol) ... failed. 0.00/0.05 Uncurrying ... failed. 0.00/0.05 Dependency Pairs: 0.00/0.05 #1: #c(x1) ->? #c(b(a(x1))) 0.00/0.05 #2: #c(x1) ->? #a(x1) 0.00/0.05 Number of SCCs: 1, DPs: 1 0.00/0.05 SCC { #1 } 0.00/0.05 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.00/0.05 Finding a loop... failed. 0.00/0.05 EOF