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