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