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