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