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