details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	1.72855 seconds
cpu usage	1.66149
user time	1.16623
system time	0.495261
max virtual memory	693856.0
max residence set size	17556.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Equational