MAYBE Problem: +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) double(X) -> +(X,X) f(0(),s(0()),X) -> f(X,double(X),X) g(X,Y) -> X g(X,Y) -> Y Proof: DP Processor: DPs: +#(X,s(Y)) -> +#(X,Y) double#(X) -> +#(X,X) f#(0(),s(0()),X) -> double#(X) f#(0(),s(0()),X) -> f#(X,double(X),X) TRS: +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) double(X) -> +(X,X) f(0(),s(0()),X) -> f(X,double(X),X) g(X,Y) -> X g(X,Y) -> Y Usable Rule Processor: DPs: +#(X,s(Y)) -> +#(X,Y) double#(X) -> +#(X,X) f#(0(),s(0()),X) -> double#(X) f#(0(),s(0()),X) -> f#(X,double(X),X) TRS: f10(x,y) -> x f10(x,y) -> y double(X) -> +(X,X) +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) TDG Processor: DPs: +#(X,s(Y)) -> +#(X,Y) double#(X) -> +#(X,X) f#(0(),s(0()),X) -> double#(X) f#(0(),s(0()),X) -> f#(X,double(X),X) TRS: f10(x,y) -> x f10(x,y) -> y double(X) -> +(X,X) +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) graph: f#(0(),s(0()),X) -> f#(X,double(X),X) -> f#(0(),s(0()),X) -> f#(X,double(X),X) f#(0(),s(0()),X) -> f#(X,double(X),X) -> f#(0(),s(0()),X) -> double#(X) f#(0(),s(0()),X) -> double#(X) -> double#(X) -> +#(X,X) double#(X) -> +#(X,X) -> +#(X,s(Y)) -> +#(X,Y) +#(X,s(Y)) -> +#(X,Y) -> +#(X,s(Y)) -> +#(X,Y) Restore Modifier: DPs: +#(X,s(Y)) -> +#(X,Y) double#(X) -> +#(X,X) f#(0(),s(0()),X) -> double#(X) f#(0(),s(0()),X) -> f#(X,double(X),X) TRS: +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) double(X) -> +(X,X) f(0(),s(0()),X) -> f(X,double(X),X) g(X,Y) -> X g(X,Y) -> Y SCC Processor: #sccs: 2 #rules: 2 #arcs: 5/16 DPs: f#(0(),s(0()),X) -> f#(X,double(X),X) TRS: +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) double(X) -> +(X,X) f(0(),s(0()),X) -> f(X,double(X),X) g(X,Y) -> X g(X,Y) -> Y Open DPs: +#(X,s(Y)) -> +#(X,Y) TRS: +(X,0()) -> X +(X,s(Y)) -> s(+(X,Y)) double(X) -> +(X,X) f(0(),s(0()),X) -> f(X,double(X),X) g(X,Y) -> X g(X,Y) -> Y Open