MAYBE Problem: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() Proof: DP Processor: DPs: g#(tt(),x,y) -> f#(x,y) g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) f#(s(x),y) -> f#(x,y) f#(x,s(y)) -> f#(x,y) TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() TDG Processor: DPs: g#(tt(),x,y) -> f#(x,y) g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) f#(s(x),y) -> f#(x,y) f#(x,s(y)) -> f#(x,y) TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() graph: f#(s(x),y) -> f#(x,y) -> f#(x,s(y)) -> f#(x,y) f#(s(x),y) -> f#(x,y) -> f#(s(x),y) -> f#(x,y) f#(x,s(y)) -> f#(x,y) -> f#(x,s(y)) -> f#(x,y) f#(x,s(y)) -> f#(x,y) -> f#(s(x),y) -> f#(x,y) g#(tt(),x,y) -> f#(x,y) -> f#(x,s(y)) -> f#(x,y) g#(tt(),x,y) -> f#(x,y) -> f#(s(x),y) -> f#(x,y) g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) -> g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) -> g#(tt(),x,y) -> f#(x,y) SCC Processor: #sccs: 2 #rules: 3 #arcs: 8/16 DPs: g#(tt(),x,y) -> g#(f(x,y),s(x),s(y)) TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() Open DPs: f#(s(x),y) -> f#(x,y) f#(x,s(y)) -> f#(x,y) TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() Subterm Criterion Processor: simple projection: pi(f#) = 1 problem: DPs: f#(s(x),y) -> f#(x,y) TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() Subterm Criterion Processor: simple projection: pi(f#) = 0 problem: DPs: TRS: g(tt(),x,y) -> g(f(x,y),s(x),s(y)) f(s(x),y) -> f(x,y) f(x,s(y)) -> f(x,y) f(0(),0()) -> tt() Qed