MAYBE Input TRS: 1: min(0(),y) -> 0() 2: min(x,0()) -> 0() 3: min(s(x),s(y)) -> s(min(x,y)) 4: max(0(),y) -> y 5: max(x,0()) -> x 6: max(s(x),s(y)) -> s(max(x,y)) 7: twice(0()) -> 0() 8: twice(s(x)) -> s(s(twice(x))) 9: -(x,0()) -> x 10: -(s(x),s(y)) -> -(x,y) 11: p(s(x)) -> x 12: f(s(x),s(y)) -> f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y)))) Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #max(s(x),s(y)) -> #max(x,y) #2: #f(s(x),s(y)) -> #f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y)))) #3: #f(s(x),s(y)) -> #-(max(s(x),s(y)),min(s(x),s(y))) #4: #f(s(x),s(y)) -> #max(s(x),s(y)) #5: #f(s(x),s(y)) -> #min(s(x),s(y)) #6: #f(s(x),s(y)) -> #p(twice(min(x,y))) #7: #f(s(x),s(y)) -> #twice(min(x,y)) #8: #f(s(x),s(y)) -> #min(x,y) #9: #-(s(x),s(y)) -> #-(x,y) #10: #min(s(x),s(y)) -> #min(x,y) #11: #twice(s(x)) -> #twice(x) Number of SCCs: 5, DPs: 5 SCC { #11 } POLO(Sum)... succeeded. s w: x1 + 1 twice w: 0 #min w: 0 #p w: 0 f w: 0 p w: 0 0 w: 0 max w: 0 #max w: 0 - w: 0 #f w: 0 #twice w: x1 min w: 0 #- w: 0 USABLE RULES: { } Removed DPs: #11 Number of SCCs: 4, DPs: 4 SCC { #9 } POLO(Sum)... succeeded. s w: x1 + 1 twice w: 0 #min w: 0 #p w: 0 f w: 0 p w: 0 0 w: 0 max w: 0 #max w: 0 - w: 0 #f w: 0 #twice w: 0 min w: 0 #- w: x2 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 3, DPs: 3 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 twice w: 0 #min w: 0 #p w: 0 f w: 0 p w: 0 0 w: 0 max w: 0 #max w: x2 - w: 0 #f w: 0 #twice w: 0 min w: 0 #- w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 2 SCC { #10 } POLO(Sum)... succeeded. s w: x1 + 1 twice w: 0 #min w: x2 #p w: 0 f w: 0 p w: 0 0 w: 0 max w: 0 #max w: 0 - w: 0 #f w: 0 #twice w: 0 min w: 0 #- w: 0 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.