details

property	value
status	complete
benchmark	bag-sum-prod-distr.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n138.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	26.7544 seconds
cpu usage	16.7984
user time	12.9555
system time	3.84295
max virtual memory	716052.0
max residence set size	26888.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR b x y z) (THEORY (AC * + U)) (RULES *(+(y,z),x) -> +(*(x,y),*(x,z)) *(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),1(y)) -> 0(+(1(#),+(x,y))) 0(#) -> # U(empty,b) -> b prod(U(x,y)) -> *(prod(x),prod(y)) prod(empty) -> 1(#) prod(singl(x)) -> x sum(U(x,y)) -> +(sum(x),sum(y)) sum(empty) -> 0(#) sum(singl(x)) -> x ) Problem 1: Dependency Pairs Processor: -> FAxioms: *#(*(x4,x5),x6) = *#(x4,*(x5,x6)) *#(x4,x5) = *#(x5,x4) +#(+(x4,x5),x6) = +#(x4,+(x5,x6)) +#(x4,x5) = +#(x5,x4) U#(U(x4,x5),x6) = U#(x4,U(x5,x6)) U#(x4,x5) = U#(x5,x4) -> Pairs: *#(*(+(y,z),x),x4) -> *#(+(*(x,y),*(x,z)),x4) *#(*(+(y,z),x),x4) -> *#(x,y) *#(*(+(y,z),x),x4) -> *#(x,z) *#(*(+(y,z),x),x4) -> +#(*(x,y),*(x,z)) *#(*(0(x),y),x4) -> *#(0(*(x,y)),x4) *#(*(0(x),y),x4) -> *#(x,y) *#(*(0(x),y),x4) -> 0#(*(x,y)) *#(*(#,x),x4) -> *#(#,x4) *#(*(1(x),y),x4) -> *#(+(0(*(x,y)),y),x4) *#(*(1(x),y),x4) -> *#(x,y) *#(*(1(x),y),x4) -> +#(0(*(x,y)),y) *#(*(1(x),y),x4) -> 0#(*(x,y)) *#(+(y,z),x) -> *#(x,y) *#(+(y,z),x) -> *#(x,z) *#(+(y,z),x) -> +#(*(x,y),*(x,z)) *#(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)),x4) -> +#(0(+(x,y)),x4) +#(+(0(x),0(y)),x4) -> +#(x,y) +#(+(0(x),0(y)),x4) -> 0#(+(x,y)) +#(+(0(x),1(y)),x4) -> +#(1(+(x,y)),x4) +#(+(0(x),1(y)),x4) -> +#(x,y) +#(+(#,x),x4) -> +#(x,x4) +#(+(1(x),1(y)),x4) -> +#(0(+(1(#),+(x,y))),x4) +#(+(1(x),1(y)),x4) -> +#(1(#),+(x,y)) +#(+(1(x),1(y)),x4) -> +#(x,y) +#(+(1(x),1(y)),x4) -> 0#(+(1(#),+(x,y))) +#(0(x),0(y)) -> +#(x,y) +#(0(x),0(y)) -> 0#(+(x,y)) +#(0(x),1(y)) -> +#(x,y) +#(1(x),1(y)) -> +#(1(#),+(x,y)) +#(1(x),1(y)) -> +#(x,y) +#(1(x),1(y)) -> 0#(+(1(#),+(x,y))) U#(U(empty,b),x4) -> U#(b,x4) PROD(U(x,y)) -> *#(prod(x),prod(y)) PROD(U(x,y)) -> PROD(x) PROD(U(x,y)) -> PROD(y) SUM(U(x,y)) -> +#(sum(x),sum(y)) SUM(U(x,y)) -> SUM(x) SUM(U(x,y)) -> SUM(y) SUM(empty) -> 0#(#) -> EAxioms: *(*(x4,x5),x6) = *(x4,*(x5,x6)) *(x4,x5) = *(x5,x4) +(+(x4,x5),x6) = +(x4,+(x5,x6)) +(x4,x5) = +(x5,x4) U(U(x4,x5),x6) = U(x4,U(x5,x6)) U(x4,x5) = U(x5,x4) -> Rules: *(+(y,z),x) -> +(*(x,y),*(x,z)) *(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),1(y)) -> 0(+(1(#),+(x,y))) 0(#) -> # U(empty,b) -> b prod(U(x,y)) -> *(prod(x),prod(y)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Equational