/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(f(),app(s(),x)) -> app(f(),x) 2: app(g(),app(app(cons(),0()),y)) -> app(g(),y) 3: app(g(),app(app(cons(),app(s(),x)),y)) -> app(s(),x) 4: app(h(),app(app(cons(),x),y)) -> app(h(),app(g(),app(app(cons(),x),y))) 5: app(app(map(),fun),nil()) -> nil() 6: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) 7: app(app(filter(),fun),nil()) -> nil() 8: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) 9: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) 10: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying app^1_g app 1: app^1_f(app^1_s(x)) -> app^1_f(x) 2: app^1_g^1_app^2_cons(0(),y) -> app^1_g(y) 3: app^1_g^1_app^2_cons(app^1_s(x),y) -> app^1_s(x) 4: app^1_h(app^2_cons(x,y)) -> app^1_h(app^1_g^1_app^2_cons(x,y)) 5: app^2_map(fun,nil()) -> nil() 6: app^2_map(fun,app^2_cons(x,xs)) -> app^2_cons(app(fun,x),app^2_map(fun,xs)) 7: app^2_filter(fun,nil()) -> nil() 8: app^2_filter(fun,app^2_cons(x,xs)) -> app^4_filter2(app(fun,x),fun,x,xs) 9: app^4_filter2(true(),fun,x,xs) -> app^2_cons(x,app^2_filter(fun,xs)) 10: app^4_filter2(false(),fun,x,xs) -> app^2_filter(fun,xs) 11: app(h(),_1) ->= app^1_h(_1) 12: app(cons(),_1) ->= app^1_cons(_1) 13: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 14: app(s(),_1) ->= app^1_s(_1) 15: app(filter(),_1) ->= app^1_filter(_1) 16: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 17: app(map(),_1) ->= app^1_map(_1) 18: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 19: app(g(),_1) ->= app^1_g(_1) 20: app(f(),_1) ->= app^1_f(_1) 21: app(filter2(),_1) ->= app^1_filter2(_1) 22: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 23: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 24: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) 25: app^1_g(app^2_cons(_1,_2)) ->= app^1_g^1_app^2_cons(_1,_2) Number of strict rules: 10 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^1_g^1_app^2_cons(0(),y) -> #app^1_g(y) #2: #app^2_map(fun,app^2_cons(x,xs)) -> #app(fun,x) #3: #app^2_map(fun,app^2_cons(x,xs)) -> #app^2_map(fun,xs) #4: #app^4_filter2(true(),fun,x,xs) -> #app^2_filter(fun,xs) #5: #app(h(),_1) ->? #app^1_h(_1) #6: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #7: #app^1_g(app^2_cons(_1,_2)) ->? #app^1_g^1_app^2_cons(_1,_2) #8: #app(f(),_1) ->? #app^1_f(_1) #9: #app^4_filter2(false(),fun,x,xs) -> #app^2_filter(fun,xs) #10: #app(g(),_1) ->? #app^1_g(_1) #11: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #12: #app^1_f(app^1_s(x)) -> #app^1_f(x) #13: #app^2_filter(fun,app^2_cons(x,xs)) -> #app^4_filter2(app(fun,x),fun,x,xs) #14: #app^2_filter(fun,app^2_cons(x,xs)) -> #app(fun,x) #15: #app^1_h(app^2_cons(x,y)) -> #app^1_h(app^1_g^1_app^2_cons(x,y)) #16: #app^1_h(app^2_cons(x,y)) -> #app^1_g^1_app^2_cons(x,y) #17: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) Number of SCCs: 3, DPs: 11 SCC { #12 } POLO(Sum)... succeeded. h w: 0 app^1_g^1_app^2_cons w: 0 s w: 0 app^1_cons w: 0 #app^1_h w: 0 #app^2_map w: 0 #app^1_g w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^1_h w: 0 #app^1_f w: x1 app^1_filter2 w: 0 true w: 0 f w: 0 filter2 w: 0 0 w: 0 #app^4_filter2 w: 0 nil w: 0 #app w: 0 map w: 0 app^1_filter w: 0 #app^1_g^1_app^2_cons w: 0 cons w: 0 app^1_f w: 0 filter w: 0 app^3_filter2 w: 0 app^2_filter w: 0 g w: 0 app^1_map w: 0 app^2_cons w: 0 app^1_s w: x1 + 1 app^2_map w: 0 #app^2_filter w: 0 app w: 0 app^1_g w: 0 USABLE RULES: { } Removed DPs: #12 Number of SCCs: 2, DPs: 10 SCC { #1 #7 } POLO(Sum)... succeeded. h w: 0 app^1_g^1_app^2_cons w: 0 s w: 0 app^1_cons w: 0 #app^1_h w: 0 #app^2_map w: 0 #app^1_g w: x1 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^1_h w: 0 #app^1_f w: 0 app^1_filter2 w: 0 true w: 0 f w: 0 filter2 w: 0 0 w: 1 #app^4_filter2 w: 0 nil w: 0 #app w: 0 map w: 0 app^1_filter w: 0 #app^1_g^1_app^2_cons w: x2 + 1 cons w: 0 app^1_f w: 0 filter w: 0 app^3_filter2 w: 0 app^2_filter w: 0 g w: 0 app^1_map w: 0 app^2_cons w: x2 + 2 app^1_s w: 1 app^2_map w: 0 #app^2_filter w: 0 app w: 0 app^1_g w: 0 USABLE RULES: { } Removed DPs: #1 #7 Number of SCCs: 1, DPs: 8 SCC { #2..4 #6 #9 #11 #14 #17 } POLO(Sum)... succeeded. h w: 0 app^1_g^1_app^2_cons w: 0 s w: 0 app^1_cons w: 0 #app^1_h w: 0 #app^2_map w: x1 + 1 #app^1_g w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 2 app^1_h w: 0 #app^1_f w: 0 app^1_filter2 w: 0 true w: 2 f w: 0 filter2 w: 0 0 w: 1 #app^4_filter2 w: x1 + x2 nil w: 0 #app w: x1 map w: 0 app^1_filter w: x1 + 2 #app^1_g^1_app^2_cons w: 1 cons w: 0 app^1_f w: 0 filter w: 0 app^3_filter2 w: x1 + x2 + x3 + 1 app^2_filter w: 0 g w: 0 app^1_map w: x1 + 2 app^2_cons w: 2 app^1_s w: 1 app^2_map w: 0 #app^2_filter w: x1 + 1 app w: 0 app^1_g w: 0 USABLE RULES: { } Removed DPs: #2 #4 #6 #9 #11 #14 #17 Number of SCCs: 1, DPs: 1 SCC { #3 } POLO(Sum)... succeeded. h w: 0 app^1_g^1_app^2_cons w: 0 s w: 0 app^1_cons w: 0 #app^1_h w: 0 #app^2_map w: x2 + 1 #app^1_g w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 2 app^1_h w: 0 #app^1_f w: 0 app^1_filter2 w: 0 true w: 2 f w: 0 filter2 w: 0 0 w: 1 #app^4_filter2 w: 0 nil w: 0 #app w: 0 map w: 0 app^1_filter w: 2 #app^1_g^1_app^2_cons w: 1 cons w: 0 app^1_f w: 0 filter w: 0 app^3_filter2 w: 1 app^2_filter w: 0 g w: 0 app^1_map w: 2 app^2_cons w: x2 + 2 app^1_s w: 1 app^2_map w: 0 #app^2_filter w: 1 app w: 0 app^1_g w: 0 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 0, DPs: 0