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