details

property	value
status	complete
benchmark	list-sum-prod-bin-assoc.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n088.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.32648396492 seconds
cpu usage	0.226022897
max memory	4620288.0

stage attributes

key	value
output-size	19320
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR l x y z) (RULES *(*(x,y),z) -> *(x,*(y,z)) *(0(x),y) -> 0(*(x,y)) *(#,x) -> # *(1(x),y) -> +(0(*(x,y)),y) +(+(x,y),z) -> +(x,+(y,z)) +(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: *#(*(x,y),z) -> *#(x,*(y,z)) *#(*(x,y),z) -> *#(y,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)) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) +#(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: *(*(x,y),z) -> *(x,*(y,z)) *(0(x),y) -> 0(*(x,y)) *(#,x) -> # *(1(x),y) -> +(0(*(x,y)),y) +(+(x,y),z) -> +(x,+(y,z)) +(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: *#(*(x,y),z) -> *#(x,*(y,z)) *#(*(x,y),z) -> *#(y,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)) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) +#(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: *(*(x,y),z) -> *(x,*(y,z)) popout

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

job log

popout

actions

all output return to TRS Stand 20472