MAYBE Problem: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x Proof: DP Processor: DPs: cond1#(s(x),y) -> gr#(s(x),y) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) cond2#(true(),x,y) -> cond1#(y,y) cond2#(false(),x,y) -> p#(x) cond2#(false(),x,y) -> cond1#(p(x),y) gr#(s(x),s(y)) -> gr#(x,y) neq#(s(x),s(y)) -> neq#(x,y) TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x TDG Processor: DPs: cond1#(s(x),y) -> gr#(s(x),y) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) cond2#(true(),x,y) -> cond1#(y,y) cond2#(false(),x,y) -> p#(x) cond2#(false(),x,y) -> cond1#(p(x),y) gr#(s(x),s(y)) -> gr#(x,y) neq#(s(x),s(y)) -> neq#(x,y) TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x graph: neq#(s(x),s(y)) -> neq#(x,y) -> neq#(s(x),s(y)) -> neq#(x,y) cond2#(false(),x,y) -> cond1#(p(x),y) -> cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) cond2#(false(),x,y) -> cond1#(p(x),y) -> cond1#(s(x),y) -> gr#(s(x),y) cond2#(true(),x,y) -> cond1#(y,y) -> cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) cond2#(true(),x,y) -> cond1#(y,y) -> cond1#(s(x),y) -> gr#(s(x),y) gr#(s(x),s(y)) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) -> cond2#(false(),x,y) -> cond1#(p(x),y) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) -> cond2#(false(),x,y) -> p#(x) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) -> cond2#(true(),x,y) -> cond1#(y,y) cond1#(s(x),y) -> gr#(s(x),y) -> gr#(s(x),s(y)) -> gr#(x,y) SCC Processor: #sccs: 3 #rules: 5 #arcs: 10/49 DPs: cond2#(false(),x,y) -> cond1#(p(x),y) cond1#(s(x),y) -> cond2#(gr(s(x),y),s(x),y) cond2#(true(),x,y) -> cond1#(y,y) TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x Open DPs: gr#(s(x),s(y)) -> gr#(x,y) TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x KBO Processor: argument filtering: pi(s) = [0] pi(cond1) = 1 pi(gr) = 0 pi(cond2) = 2 pi(true) = [] pi(false) = [] pi(p) = [0] pi(0) = [] pi(neq) = [1] pi(gr#) = 1 weight function: w0 = 1 w(gr#) = w(0) = w(false) = w(true) = w(cond2) = w(gr) = w(cond1) = w( s) = 1 w(neq) = w(p) = 0 precedence: gr# ~ neq ~ p ~ s > 0 > false ~ true ~ cond2 ~ gr ~ cond1 problem: DPs: TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x Qed DPs: neq#(s(x),s(y)) -> neq#(x,y) TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x KBO Processor: argument filtering: pi(s) = [0] pi(cond1) = 1 pi(gr) = 0 pi(cond2) = 2 pi(true) = [] pi(false) = [] pi(p) = [0] pi(0) = [] pi(neq) = [1] pi(neq#) = 1 weight function: w0 = 1 w(neq#) = w(0) = w(false) = w(true) = w(cond2) = w(gr) = w(cond1) = w( s) = 1 w(neq) = w(p) = 0 precedence: neq# ~ neq ~ p ~ s > 0 > false ~ true ~ cond2 ~ gr ~ cond1 problem: DPs: TRS: cond1(s(x),y) -> cond2(gr(s(x),y),s(x),y) cond2(true(),x,y) -> cond1(y,y) cond2(false(),x,y) -> cond1(p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y)) -> neq(x,y) p(0()) -> 0() p(s(x)) -> x Qed