/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR l x y)
(RULES
*(0(x),y) -> 0(*(x,y))
*(#,x) -> #
*(1(x),y) -> +(0(*(x,y)),y)
+(0(x),0(y)) -> 0(+(x,y))
+(0(x),1(y)) -> 1(+(x,y))
+(#,x) -> x
+(1(x),0(y)) -> 1(+(x,y))
+(1(x),1(y)) -> 0(+(+(x,y),1(#)))
+(x,#) -> x
0(#) -> #
prod(cons(x,l)) -> *(x,prod(l))
prod(nil) -> 1(#)
sum(cons(x,l)) -> +(x,sum(l))
sum(nil) -> 0(#)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 *#(0(x),y) -> *#(x,y)
 *#(0(x),y) -> 0#(*(x,y))
 *#(1(x),y) -> *#(x,y)
 *#(1(x),y) -> +#(0(*(x,y)),y)
 *#(1(x),y) -> 0#(*(x,y))
 +#(0(x),0(y)) -> +#(x,y)
 +#(0(x),0(y)) -> 0#(+(x,y))
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
 +#(1(x),1(y)) -> 0#(+(+(x,y),1(#)))
 PROD(cons(x,l)) -> *#(x,prod(l))
 PROD(cons(x,l)) -> PROD(l)
 SUM(cons(x,l)) -> +#(x,sum(l))
 SUM(cons(x,l)) -> SUM(l)
 SUM(nil) -> 0#(#)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)

Problem 1: 

SCC Processor:
-> Pairs:
 *#(0(x),y) -> *#(x,y)
 *#(0(x),y) -> 0#(*(x,y))
 *#(1(x),y) -> *#(x,y)
 *#(1(x),y) -> +#(0(*(x,y)),y)
 *#(1(x),y) -> 0#(*(x,y))
 +#(0(x),0(y)) -> +#(x,y)
 +#(0(x),0(y)) -> 0#(+(x,y))
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
 +#(1(x),1(y)) -> 0#(+(+(x,y),1(#)))
 PROD(cons(x,l)) -> *#(x,prod(l))
 PROD(cons(x,l)) -> PROD(l)
 SUM(cons(x,l)) -> +#(x,sum(l))
 SUM(cons(x,l)) -> SUM(l)
 SUM(nil) -> 0#(#)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(0(x),0(y)) -> +#(x,y)
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->->Cycle:
->->-> Pairs:
 SUM(cons(x,l)) -> SUM(l)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->->Cycle:
->->-> Pairs:
 *#(0(x),y) -> *#(x,y)
 *#(1(x),y) -> *#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->->Cycle:
->->-> Pairs:
 PROD(cons(x,l)) -> PROD(l)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)


The problem is decomposed in 4 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 +#(0(x),0(y)) -> +#(x,y)
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
-> Usable rules:
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[+](X1,X2) = X1 + X2 + 1
[0](X) = X + 1
[#] = 0
[1](X) = X + 2
[+#](X1,X2) = 2.X1 + 2.X2

Problem 1.1: 

SCC Processor:
-> Pairs:
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 +#(0(x),1(y)) -> +#(x,y)
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
-> Usable rules:
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[+](X1,X2) = X1 + 2.X2
[0](X) = X
[#] = 1
[1](X) = X + 2
[+#](X1,X2) = X1 + 2.X2

Problem 1.1: 

SCC Processor:
-> Pairs:
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 +#(1(x),0(y)) -> +#(x,y)
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
-> Usable rules:
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[+](X1,X2) = X1 + X2
[0](X) = X + 1
[#] = 0
[1](X) = X + 1
[+#](X1,X2) = 2.X1 + 2.X2

Problem 1.1: 

SCC Processor:
-> Pairs:
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 +#(1(x),1(y)) -> +#(+(x,y),1(#))
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
-> Usable rules:
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[+](X1,X2) = X1 + X2
[0](X) = 2.X
[#] = 0
[1](X) = 2.X + 2
[+#](X1,X2) = 2.X1 + 2.X2

Problem 1.1: 

SCC Processor:
-> Pairs:
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(1(x),1(y)) -> +#(x,y)
->->-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)

Problem 1.1: 

Subterm Processor:
-> Pairs:
 +#(1(x),1(y)) -> +#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Projection:
 pi(+#) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 SUM(cons(x,l)) -> SUM(l)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Projection:
 pi(SUM) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 *#(0(x),y) -> *#(x,y)
 *#(1(x),y) -> *#(x,y)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Projection:
 pi(*#) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

Subterm Processor:
-> Pairs:
 PROD(cons(x,l)) -> PROD(l)
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Projection:
 pi(PROD) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 *(0(x),y) -> 0(*(x,y))
 *(#,x) -> #
 *(1(x),y) -> +(0(*(x,y)),y)
 +(0(x),0(y)) -> 0(+(x,y))
 +(0(x),1(y)) -> 1(+(x,y))
 +(#,x) -> x
 +(1(x),0(y)) -> 1(+(x,y))
 +(1(x),1(y)) -> 0(+(+(x,y),1(#)))
 +(x,#) -> x
 0(#) -> #
 prod(cons(x,l)) -> *(x,prod(l))
 prod(nil) -> 1(#)
 sum(cons(x,l)) -> +(x,sum(l))
 sum(nil) -> 0(#)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.