YES Problem: app(app(plus(),0()),y) -> y app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y)) app(inc(),xs) -> app(app(map(),app(plus(),app(s(),0()))),xs) app(app(map(),f),nil()) -> nil() app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) Proof: Uncurry Processor: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) DP Processor: DPs: plus{2,#}(s1(x),y) -> plus{2,#}(x,y) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) app#(plus1(x4),x5) -> plus{2,#}(x4,x5) app#(inc(),x5) -> inc{1,#}(x5) app#(map1(x4),x5) -> map{2,#}(x4,x5) TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) TDG Processor: DPs: plus{2,#}(s1(x),y) -> plus{2,#}(x,y) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) app#(plus1(x4),x5) -> plus{2,#}(x4,x5) app#(inc(),x5) -> inc{1,#}(x5) app#(map1(x4),x5) -> map{2,#}(x4,x5) TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) graph: app#(map1(x4),x5) -> map{2,#}(x4,x5) -> map{2,#}(f,cons2(x,xs)) -> app#(f,x) app#(map1(x4),x5) -> map{2,#}(x4,x5) -> map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) app#(plus1(x4),x5) -> plus{2,#}(x4,x5) -> plus{2,#}(s1(x),y) -> plus{2,#}(x,y) app#(inc(),x5) -> inc{1,#}(x5) -> inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) -> app#(map1(x4),x5) -> map{2,#}(x4,x5) map{2,#}(f,cons2(x,xs)) -> app#(f,x) -> app#(inc(),x5) -> inc{1,#}(x5) map{2,#}(f,cons2(x,xs)) -> app#(f,x) -> app#(plus1(x4),x5) -> plus{2,#}(x4,x5) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) -> map{2,#}(f,cons2(x,xs)) -> app#(f,x) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) -> map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) -> map{2,#}(f,cons2(x,xs)) -> app#(f,x) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) -> map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) plus{2,#}(s1(x),y) -> plus{2,#}(x,y) -> plus{2,#}(s1(x),y) -> plus{2,#}(x,y) SCC Processor: #sccs: 2 #rules: 6 #arcs: 12/49 DPs: app#(map1(x4),x5) -> map{2,#}(x4,x5) map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) app#(inc(),x5) -> inc{1,#}(x5) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) Subterm Criterion Processor: simple projection: pi(inc{1,#}) = 0 pi(map{2,#}) = 1 pi(app#) = 1 problem: DPs: app#(map1(x4),x5) -> map{2,#}(x4,x5) app#(inc(),x5) -> inc{1,#}(x5) inc{1,#}(xs) -> map{2,#}(plus1(s1(0())),xs) TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) SCC Processor: #sccs: 0 #rules: 0 #arcs: 9/9 DPs: plus{2,#}(s1(x),y) -> plus{2,#}(x,y) TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) Subterm Criterion Processor: simple projection: pi(plus{2,#}) = 0 problem: DPs: TRS: plus2(0(),y) -> y plus2(s1(x),y) -> s1(plus2(x,y)) inc1(xs) -> map2(plus1(s1(0())),xs) map2(f,nil()) -> nil() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) app(plus1(x4),x5) -> plus2(x4,x5) app(plus(),x5) -> plus1(x5) app(s(),x5) -> s1(x5) app(inc(),x5) -> inc1(x5) app(map1(x4),x5) -> map2(x4,x5) app(map(),x5) -> map1(x5) app(cons1(x4),x5) -> cons2(x4,x5) app(cons(),x5) -> cons1(x5) Qed