YES Problem 1: (VAR A B X Y) (THEORY (AC mult plus union)) (RULES 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X ) Problem 1: Dependency Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: MULT(0(X),Y) -> 0#(mult(X,Y)) MULT(0(X),Y) -> MULT(X,Y) MULT(mult(0(X),Y),x4) -> 0#(mult(X,Y)) MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> 0#(mult(X,Y)) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> PLUS(0(mult(X,Y)),Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> 0#(mult(X,Y)) MULT(1(X),Y) -> MULT(X,Y) MULT(1(X),Y) -> PLUS(0(mult(X,Y)),Y) PLUS(0(X),0(Y)) -> 0#(plus(X,Y)) PLUS(0(X),0(Y)) -> PLUS(X,Y) PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> 0#(plus(X,Y)) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> 0#(plus(plus(X,Y),1(z))) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> 0#(plus(plus(X,Y),1(z))) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) PROD(union(A,B)) -> MULT(prod(A),prod(B)) PROD(union(A,B)) -> PROD(A) PROD(union(A,B)) -> PROD(B) SUM(union(A,B)) -> PLUS(sum(A),sum(B)) SUM(union(A,B)) -> SUM(A) SUM(union(A,B)) -> SUM(B) SUM(empty) -> 0#(z) UNION(union(empty,X),x4) -> UNION(X,x4) UNION(union(X,empty),x4) -> UNION(X,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) Problem 1: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: MULT(0(X),Y) -> 0#(mult(X,Y)) MULT(0(X),Y) -> MULT(X,Y) MULT(mult(0(X),Y),x4) -> 0#(mult(X,Y)) MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> 0#(mult(X,Y)) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> PLUS(0(mult(X,Y)),Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> 0#(mult(X,Y)) MULT(1(X),Y) -> MULT(X,Y) MULT(1(X),Y) -> PLUS(0(mult(X,Y)),Y) PLUS(0(X),0(Y)) -> 0#(plus(X,Y)) PLUS(0(X),0(Y)) -> PLUS(X,Y) PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> 0#(plus(X,Y)) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> 0#(plus(plus(X,Y),1(z))) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> 0#(plus(plus(X,Y),1(z))) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) PROD(union(A,B)) -> MULT(prod(A),prod(B)) PROD(union(A,B)) -> PROD(A) PROD(union(A,B)) -> PROD(B) SUM(union(A,B)) -> PLUS(sum(A),sum(B)) SUM(union(A,B)) -> SUM(A) SUM(union(A,B)) -> SUM(B) SUM(empty) -> 0#(z) UNION(union(empty,X),x4) -> UNION(X,x4) UNION(union(X,empty),x4) -> UNION(X,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: UNION(union(empty,X),x4) -> UNION(X,x4) UNION(union(X,empty),x4) -> UNION(X,x4) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) UNION(union(x4,x5),x6) -> UNION(x4,union(x5,x6)) UNION(x4,x5) -> UNION(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->->Cycle: ->->-> Pairs: PLUS(0(X),0(Y)) -> PLUS(X,Y) PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->->Cycle: ->->-> Pairs: SUM(union(A,B)) -> SUM(A) SUM(union(A,B)) -> SUM(B) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty ->->Cycle: ->->-> Pairs: MULT(0(X),Y) -> MULT(X,Y) MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->->Cycle: ->->-> Pairs: PROD(union(A,B)) -> PROD(A) PROD(union(A,B)) -> PROD(B) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty The problem is decomposed in 5 subproblems. Problem 1.1: Reduction Pairs Processor: -> FAxioms: UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: UNION(union(empty,X),x4) -> UNION(X,x4) UNION(union(X,empty),x4) -> UNION(X,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = 0 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = 0 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = X1 + X2 [1](X) = 0 [empty] = 2 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 2.X1 + 2.X2 Problem 1.1: SCC Processor: -> FAxioms: UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: UNION(union(X,empty),x4) -> UNION(X,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: UNION(union(X,empty),x4) -> UNION(X,x4) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) UNION(union(x4,x5),x6) -> UNION(x4,union(x5,x6)) UNION(x4,x5) -> UNION(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) Problem 1.1: Reduction Pairs Processor: -> FAxioms: UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: UNION(union(X,empty),x4) -> UNION(X,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = 0 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = 0 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = X1 + X2 + 2 [1](X) = 0 [empty] = 2 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 2.X1 + 2.X2 Problem 1.1: SCC Processor: -> FAxioms: UNION(union(x4,x5),x6) = UNION(x4,union(x5,x6)) UNION(x4,x5) = UNION(x5,x4) -> Pairs: Empty -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: UNION(union(x4,x5),x6) -> UNION(x4,x5) UNION(x4,union(x5,x6)) -> UNION(x5,x6) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(0(X),0(Y)) -> PLUS(X,Y) PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(0(X),1(Y)) -> PLUS(X,Y) PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(0(plus(X,Y)),x4) PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X + 2 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = X1 + X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),0(Y)),x4) -> PLUS(X,Y) PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(1(plus(X,Y)),x4) PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(0(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = 2.X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = 2.X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(0(plus(plus(X,Y),1(z))),x4) PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(plus(X,Y),1(z)) PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(1(X),1(Y)),x4) -> PLUS(X,Y) PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(plus(z,X),x4) -> PLUS(X,x4) PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 1 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = X1 + X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(plus(X,Y),1(z)) PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = X1 + X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(1(X),1(Y)) -> PLUS(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) PLUS(x4,x5) -> PLUS(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) Problem 1.2: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: PLUS(1(X),1(Y)) -> PLUS(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = 0 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 1 [0#](X) = 0 [MULT](X1,X2) = 0 [PLUS](X1,X2) = 2.X1 + 2.X2 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.2: SCC Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) -> Pairs: Empty -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.3: Subterm Processor: -> FAxioms: Empty -> Pairs: SUM(union(A,B)) -> SUM(A) SUM(union(A,B)) -> SUM(B) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty ->Projection: pi(SUM) = [1] Problem 1.3: SCC Processor: -> FAxioms: Empty -> Pairs: Empty -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(0(X),Y) -> MULT(X,Y) MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 1 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = X1.X2 + X1 + X2 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 1 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = X1.X2 + X1 + X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(0(X),Y),x4) -> MULT(X,Y) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 1 ->Interpretation: [0](X) = X + 1 [and](X1,X2) = 0 [mult](X1,X2) = X1.X2 + X1 + X2 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 1 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = X1.X2 + X1 + X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(plus(0(mult(X,Y)),Y),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 1 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = X1.X2 + X1 + X2 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 1 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 1 [0#](X) = 0 [MULT](X1,X2) = X1.X2 + X1 + X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(1(X),Y),x4) -> MULT(X,Y) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 1 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = X1.X2 + X1 + X2 [plus](X1,X2) = X1 + X2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 1 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 1 [0#](X) = 0 [MULT](X1,X2) = X1.X2 + X1 + X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) MULT(1(X),Y) -> MULT(X,Y) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 1 ->Interpretation: [0](X) = X [and](X1,X2) = 0 [mult](X1,X2) = X1.X2 + X1 + X2 [plus](X1,X2) = X1 + X2 + 1 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = X + 1 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = X1.X2 + X1 + X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(0(X),Y),x4) -> MULT(0(mult(X,Y)),x4) MULT(mult(z,X),x4) -> MULT(z,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = 2 [and](X1,X2) = 0 [mult](X1,X2) = X1 + X2 + 2 [plus](X1,X2) = X1 + X2 + 2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 0 [0#](X) = 0 [MULT](X1,X2) = 2.X1 + 2.X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(z,X),x4) -> MULT(z,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MULT(mult(z,X),x4) -> MULT(z,x4) -> FAxioms: mult(mult(x4,x5),x6) -> mult(x4,mult(x5,x6)) mult(x4,x5) -> mult(x5,x4) plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) plus(x4,x5) -> plus(x5,x4) union(union(x4,x5),x6) -> union(x4,union(x5,x6)) union(x4,x5) -> union(x5,x4) MULT(mult(x4,x5),x6) -> MULT(x4,mult(x5,x6)) MULT(x4,x5) -> MULT(x5,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) ->->-> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) Problem 1.4: Reduction Pairs Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: MULT(mult(z,X),x4) -> MULT(z,x4) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Usable Equations: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> Usable Rules: 0(z) -> z mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0](X) = 2 [and](X1,X2) = 0 [mult](X1,X2) = X1 + X2 + 2 [plus](X1,X2) = X1 + X2 + 2 [prod](X) = 0 [sum](X) = 0 [union](X1,X2) = 0 [1](X) = 2 [empty] = 0 [singl](X) = 0 [tt] = 0 [z] = 2 [0#](X) = 0 [MULT](X1,X2) = 2.X1 + 2.X2 [PLUS](X1,X2) = 0 [PROD](X) = 0 [SUM](X) = 0 [UNION](X1,X2) = 0 Problem 1.4: SCC Processor: -> FAxioms: MULT(mult(x4,x5),x6) = MULT(x4,mult(x5,x6)) MULT(x4,x5) = MULT(x5,x4) -> Pairs: Empty -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: MULT(mult(x4,x5),x6) -> MULT(x4,x5) MULT(x4,mult(x5,x6)) -> MULT(x5,x6) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.5: Subterm Processor: -> FAxioms: Empty -> Pairs: PROD(union(A,B)) -> PROD(A) PROD(union(A,B)) -> PROD(B) -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty ->Projection: pi(PROD) = [1] Problem 1.5: SCC Processor: -> FAxioms: Empty -> Pairs: Empty -> EAxioms: mult(mult(x4,x5),x6) = mult(x4,mult(x5,x6)) mult(x4,x5) = mult(x5,x4) plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) plus(x4,x5) = plus(x5,x4) union(union(x4,x5),x6) = union(x4,union(x5,x6)) union(x4,x5) = union(x5,x4) -> Rules: 0(z) -> z and(tt,X) -> X mult(0(X),Y) -> 0(mult(X,Y)) mult(1(X),Y) -> plus(0(mult(X,Y)),Y) mult(z,X) -> z plus(0(X),0(Y)) -> 0(plus(X,Y)) plus(0(X),1(Y)) -> 1(plus(X,Y)) plus(1(X),1(Y)) -> 0(plus(plus(X,Y),1(z))) plus(z,X) -> X prod(union(A,B)) -> mult(prod(A),prod(B)) prod(empty) -> 1(z) prod(singl(X)) -> X sum(union(A,B)) -> plus(sum(A),sum(B)) sum(empty) -> 0(z) sum(singl(X)) -> X union(empty,X) -> X union(X,empty) -> X -> SRules: Empty ->Strongly Connected Components: There is no strongly connected component The problem is finite.