MAYBE Time: 0.075 Problem: Equations: TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcdC(0(),y) -> y gcdC(s(x),0()) -> s(x) gcdC(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcdC(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcdC(minus(y,x),s(x)) Proof: DP Processor: Equations#: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) gcd{C,#}(s(x),s(y)) -> le#(y,x) gcd{C,#}(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) if_gcd#(true(),s(x),s(y)) -> gcd{C,#}(minus(x,y),s(y)) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) if_gcd#(false(),s(x),s(y)) -> gcd{C,#}(minus(y,x),s(x)) Equations: TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcdC(0(),y) -> y gcdC(s(x),0()) -> s(x) gcdC(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcdC(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcdC(minus(y,x),s(x)) S: AC-EDG Processor: Equations#: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) gcd{C,#}(s(x),s(y)) -> le#(y,x) gcd{C,#}(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) if_gcd#(true(),s(x),s(y)) -> gcd{C,#}(minus(x,y),s(y)) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) if_gcd#(false(),s(x),s(y)) -> gcd{C,#}(minus(y,x),s(x)) Equations: TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcdC(0(),y) -> y gcdC(s(x),0()) -> s(x) gcdC(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcdC(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcdC(minus(y,x),s(x)) S: Open