/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app(perfectp(),0()) -> false() 2: app(perfectp(),app(s(),x)) -> app(app(app(app(f(),x),app(s(),0())),app(s(),x)),app(s(),x)) 3: app(app(app(app(f(),0()),y),0()),u) -> true() 4: app(app(app(app(f(),0()),y),app(s(),z)),u) -> false() 5: app(app(app(app(f(),app(s(),x)),0()),z),u) -> app(app(app(app(f(),x),u),app(app(minus(),z),app(s(),x))),u) 6: app(app(app(app(f(),app(s(),x)),app(s(),y)),z),u) -> app(app(app(if(),app(app(le(),x),y)),app(app(app(app(f(),app(s(),x)),app(app(minus(),y),x)),z),u)),app(app(app(app(f(),x),u),z),u)) 7: app(app(map(),fun),nil()) -> nil() 8: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) 9: app(app(filter(),fun),nil()) -> nil() 10: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) 11: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) 12: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying app 1: app^1_perfectp(0()) -> false() 2: app^1_perfectp(app^1_s(x)) -> app^4_f(x,app^1_s(0()),app^1_s(x),app^1_s(x)) 3: app^4_f(0(),y,0(),u) -> true() 4: app^4_f(0(),y,app^1_s(z),u) -> false() 5: app^4_f(app^1_s(x),0(),z,u) -> app^4_f(x,u,app^2_minus(z,app^1_s(x)),u) 6: app^4_f(app^1_s(x),app^1_s(y),z,u) -> app^3_if(app^2_le(x,y),app^4_f(app^1_s(x),app^2_minus(y,x),z,u),app^4_f(x,u,z,u)) 7: app^2_map(fun,nil()) -> nil() 8: app^2_map(fun,app^2_cons(x,xs)) -> app^2_cons(app(fun,x),app^2_map(fun,xs)) 9: app^2_filter(fun,nil()) -> nil() 10: app^2_filter(fun,app^2_cons(x,xs)) -> app^4_filter2(app(fun,x),fun,x,xs) 11: app^4_filter2(true(),fun,x,xs) -> app^2_cons(x,app^2_filter(fun,xs)) 12: app^4_filter2(false(),fun,x,xs) -> app^2_filter(fun,xs) 13: app(le(),_1) ->= app^1_le(_1) 14: app(app^1_le(_1),_2) ->= app^2_le(_1,_2) 15: app(if(),_1) ->= app^1_if(_1) 16: app(app^1_if(_1),_2) ->= app^2_if(_1,_2) 17: app(app^2_if(_1,_2),_3) ->= app^3_if(_1,_2,_3) 18: app(cons(),_1) ->= app^1_cons(_1) 19: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 20: app(s(),_1) ->= app^1_s(_1) 21: app(filter(),_1) ->= app^1_filter(_1) 22: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 23: app(perfectp(),_1) ->= app^1_perfectp(_1) 24: app(map(),_1) ->= app^1_map(_1) 25: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 26: app(minus(),_1) ->= app^1_minus(_1) 27: app(app^1_minus(_1),_2) ->= app^2_minus(_1,_2) 28: app(f(),_1) ->= app^1_f(_1) 29: app(app^1_f(_1),_2) ->= app^2_f(_1,_2) 30: app(app^2_f(_1,_2),_3) ->= app^3_f(_1,_2,_3) 31: app(app^3_f(_1,_2,_3),_4) ->= app^4_f(_1,_2,_3,_4) 32: app(filter2(),_1) ->= app^1_filter2(_1) 33: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 34: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 35: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) Number of strict rules: 12 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^1_perfectp(app^1_s(x)) -> #app^4_f(x,app^1_s(0()),app^1_s(x),app^1_s(x)) #2: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #3: #app^4_f(app^1_s(x),app^1_s(y),z,u) -> #app^4_f(app^1_s(x),app^2_minus(y,x),z,u) #4: #app^4_f(app^1_s(x),app^1_s(y),z,u) -> #app^4_f(x,u,z,u) #5: #app^4_filter2(true(),fun,x,xs) -> #app^2_filter(fun,xs) #6: #app(perfectp(),_1) ->? #app^1_perfectp(_1) #7: #app^4_filter2(false(),fun,x,xs) -> #app^2_filter(fun,xs) #8: #app(app^3_f(_1,_2,_3),_4) ->? #app^4_f(_1,_2,_3,_4) #9: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #10: #app^2_filter(fun,app^2_cons(x,xs)) -> #app^4_filter2(app(fun,x),fun,x,xs) #11: #app^2_filter(fun,app^2_cons(x,xs)) -> #app(fun,x) #12: #app^4_f(app^1_s(x),0(),z,u) -> #app^4_f(x,u,app^2_minus(z,app^1_s(x)),u) #13: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #14: #app^2_map(fun,app^2_cons(x,xs)) -> #app(fun,x) #15: #app^2_map(fun,app^2_cons(x,xs)) -> #app^2_map(fun,xs) Number of SCCs: 2, DPs: 11 SCC { #4 #12 } POLO(Sum)... succeeded. le w: 0 s w: 0 app^1_cons w: 0 app^3_f w: 0 #app^2_map w: 0 minus w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^2_f w: 0 app^1_le w: 0 app^1_filter2 w: 0 true w: 0 f w: 0 filter2 w: 0 0 w: 2 if w: 0 #app^4_f w: x1 #app^4_filter2 w: 0 nil w: 0 app^2_le w: 0 #app w: 0 app^2_minus w: x2 map w: 0 app^1_filter w: 0 #app^1_perfectp w: 0 cons w: 0 app^2_if w: 0 app^3_if w: 0 app^1_f w: 0 filter w: 0 perfectp w: 0 app^1_minus w: 0 app^3_filter2 w: 0 app^2_filter w: 0 app^1_map w: 0 app^2_cons w: 0 app^1_if w: 0 app^1_perfectp w: 0 app^1_s w: x1 + 1 app^2_map w: 0 #app^2_filter w: 0 app^4_f w: 0 app w: 0 USABLE RULES: { } Removed DPs: #4 #12 Number of SCCs: 1, DPs: 9 SCC { #2 #5 #7 #9..11 #13..15 } POLO(Sum)... succeeded. le w: 1 s w: 8 app^1_cons w: 3 app^3_f w: x1 + x2 + x3 + 2 #app^2_map w: x1 + x2 minus w: 1 app^2_filter2 w: 1 app^4_filter2 w: x2 + x3 + x4 + 10 false w: 1 app^2_f w: x1 + 1 app^1_le w: 1 app^1_filter2 w: x1 + 3 true w: 2 f w: 1 filter2 w: 1 0 w: 2 if w: 1 #app^4_f w: 0 #app^4_filter2 w: x2 + x3 + x4 + 1 nil w: 2 app^2_le w: 1 #app w: x1 + x2 app^2_minus w: x2 + 5 map w: 1 app^1_filter w: x1 + 3 #app^1_perfectp w: 0 cons w: 1 app^2_if w: 1 app^3_if w: x1 + x2 + 3 app^1_f w: x1 + 3 filter w: 1 perfectp w: 11 app^1_minus w: x1 + 3 app^3_filter2 w: x1 + x2 + x3 + 9 app^2_filter w: x1 + x2 + 5 app^1_map w: x1 + 1 app^2_cons w: x1 + x2 + 5 app^1_if w: 3 app^1_perfectp w: x1 + 12 app^1_s w: x1 + 9 app^2_map w: 1 #app^2_filter w: x1 + x2 app^4_f w: x2 + x4 + 1 app w: x1 + 1 USABLE RULES: { 1 4 9..12 } Removed DPs: #2 #5 #7 #9..11 #13..15 Number of SCCs: 0, DPs: 0