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