/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app(f(),app(f(),x)) -> app(g(),app(f(),x)) 2: app(g(),app(g(),x)) -> app(f(),x) 3: app(app(map(),fun),nil()) -> nil() 4: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) 5: app(app(filter(),fun),nil()) -> nil() 6: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) 7: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) 8: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Number of strict rules: 8 Direct poly ... failed. Freezing app 1: app❆1_f(app❆1_f(x)) -> app❆1_g(app❆1_f(x)) 2: app❆1_g(app❆1_g(x)) -> app❆1_f(x) 3: app❆2_map(fun,nil()) -> nil() 4: app❆2_map(fun,app❆2_cons(x,xs)) -> app❆2_cons(app(fun,x),app❆2_map(fun,xs)) 5: app❆2_filter(fun,nil()) -> nil() 6: app❆2_filter(fun,app❆2_cons(x,xs)) -> app❆4_filter2(app(fun,x),fun,x,xs) 7: app❆4_filter2(true(),fun,x,xs) -> app❆2_cons(x,app❆2_filter(fun,xs)) 8: app❆4_filter2(false(),fun,x,xs) -> app❆2_filter(fun,xs) 9: app(cons(),_1) ->= app❆1_cons(_1) 10: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2) 11: app(filter(),_1) ->= app❆1_filter(_1) 12: app(app❆1_filter(_1),_2) ->= app❆2_filter(_1,_2) 13: app(map(),_1) ->= app❆1_map(_1) 14: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2) 15: app(g(),_1) ->= app❆1_g(_1) 16: app(f(),_1) ->= app❆1_f(_1) 17: app(filter2(),_1) ->= app❆1_filter2(_1) 18: app(app❆1_filter2(_1),_2) ->= app❆2_filter2(_1,_2) 19: app(app❆2_filter2(_1,_2),_3) ->= app❆3_filter2(_1,_2,_3) 20: app(app❆3_filter2(_1,_2,_3),_4) ->= app❆4_filter2(_1,_2,_3,_4) Number of strict rules: 8 Direct poly ... failed. Dependency Pairs: #1: #app❆1_g(app❆1_g(x)) -> #app❆1_f(x) #2: #app❆2_filter(fun,app❆2_cons(x,xs)) -> #app❆4_filter2(app(fun,x),fun,x,xs) #3: #app❆2_filter(fun,app❆2_cons(x,xs)) -> #app(fun,x) #4: #app(app❆1_filter(_1),_2) ->? #app❆2_filter(_1,_2) #5: #app(app❆1_map(_1),_2) ->? #app❆2_map(_1,_2) #6: #app(app❆3_filter2(_1,_2,_3),_4) ->? #app❆4_filter2(_1,_2,_3,_4) #7: #app❆4_filter2(true(),fun,x,xs) -> #app❆2_filter(fun,xs) #8: #app(f(),_1) ->? #app❆1_f(_1) #9: #app❆1_f(app❆1_f(x)) -> #app❆1_g(app❆1_f(x)) #10: #app❆4_filter2(false(),fun,x,xs) -> #app❆2_filter(fun,xs) #11: #app(g(),_1) ->? #app❆1_g(_1) #12: #app❆2_map(fun,app❆2_cons(x,xs)) -> #app(fun,x) #13: #app❆2_map(fun,app❆2_cons(x,xs)) -> #app❆2_map(fun,xs) Number of SCCs: 2, DPs: 10 SCC { #1 #9 } Sum... succeeded. #app❆2_map(x1,x2) w: (0) app❆1_map(x1) w: (0) app❆4_filter2(x1,x2,x3,x4) w: (0) #app❆1_g(x1) w: (x1) app❆2_map(x1,x2) w: (0) false() w: (0) true() w: (0) f() w: (0) filter2() w: (0) app❆2_filter(x1,x2) w: (0) app❆1_f(x1) w: (2440 + x1) nil() w: (0) app❆1_filter(x1) w: (0) #app(x1,x2) w: (0) map() w: (0) #app❆4_filter2(x1,x2,x3,x4) w: (0) app❆2_filter2(x1,x2) w: (0) #app❆2_filter(x1,x2) w: (0) cons() w: (0) app❆2_cons(x1,x2) w: (0) #app❆1_f(x1) w: (1 + x1) filter() w: (0) app❆1_g(x1) w: (2439 + x1) app❆1_filter2(x1) w: (0) app❆1_cons(x1) w: (0) app❆3_filter2(x1,x2,x3) w: (0) g() w: (0) app(x1,x2) w: (0) USABLE RULES: { 1 2 } Removed DPs: #1 #9 Number of SCCs: 1, DPs: 8 SCC { #3..7 #10 #12 #13 } Sum... succeeded. #app❆2_map(x1,x2) w: (x2) app❆1_map(x1) w: (1) app❆4_filter2(x1,x2,x3,x4) w: (0) #app❆1_g(x1) w: (x1) app❆2_map(x1,x2) w: (0) false() w: (1) true() w: (1) f() w: (0) filter2() w: (0) app❆2_filter(x1,x2) w: (0) app❆1_f(x1) w: (1 + x1) nil() w: (0) app❆1_filter(x1) w: (1) #app(x1,x2) w: (2 + x2) map() w: (0) #app❆4_filter2(x1,x2,x3,x4) w: (1 + x4) app❆2_filter2(x1,x2) w: (0) #app❆2_filter(x1,x2) w: (x2) cons() w: (0) app❆2_cons(x1,x2) w: (3 + x2 + x1) #app❆1_f(x1) w: (1) filter() w: (0) app❆1_g(x1) w: (1 + x1) app❆1_filter2(x1) w: (0) app❆1_cons(x1) w: (0) app❆3_filter2(x1,x2,x3) w: (1) g() w: (0) app(x1,x2) w: (0) USABLE RULES: { 1 2 } Removed DPs: #3..7 #10 #12 #13 Number of SCCs: 0, DPs: 0