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