details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.027484 seconds
cpu usage	0.028032
user time	0.0154
system time	0.012632
max virtual memory	113188.0
max residence set size	8116.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S l:S l1:S l2:S x:S y:S z:S) (RULES *(*(x:S,y:S),z:S) -> *(x:S,*(y:S,z:S)) *(0,x:S) -> 0 *(s(x:S),s(y:S)) -> s(+(*(x:S,y:S),+(x:S,y:S))) *(x:S,0) -> 0 +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(0,x:S) -> x:S +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(x:S,0) -> x:S app(cons(x:S,l1:S),l2:S) -> cons(x:S,app(l1:S,l2:S)) app(nil,l:S) -> l:S prod(app(l1:S,l2:S)) -> *(prod(l1:S),prod(l2:S)) prod(cons(x:S,l:S)) -> *(x:S,prod(l:S)) prod(nil) -> s(0) sum(app(l1:S,l2:S)) -> +(sum(l1:S),sum(l2:S)) sum(cons(x:S,l:S)) -> +(x:S,sum(l:S)) sum(nil) -> 0 ) Problem 1: Dependency Pairs Processor: -> Pairs: *#(*(x:S,y:S),z:S) -> *#(x:S,*(y:S,z:S)) *#(*(x:S,y:S),z:S) -> *#(y:S,z:S) *#(s(x:S),s(y:S)) -> *#(x:S,y:S) *#(s(x:S),s(y:S)) -> +#(*(x:S,y:S),+(x:S,y:S)) *#(s(x:S),s(y:S)) -> +#(x:S,y:S) +#(+(x:S,y:S),z:S) -> +#(x:S,+(y:S,z:S)) +#(+(x:S,y:S),z:S) -> +#(y:S,z:S) +#(s(x:S),s(y:S)) -> +#(x:S,y:S) APP(cons(x:S,l1:S),l2:S) -> APP(l1:S,l2:S) PROD(app(l1:S,l2:S)) -> *#(prod(l1:S),prod(l2:S)) PROD(app(l1:S,l2:S)) -> PROD(l1:S) PROD(app(l1:S,l2:S)) -> PROD(l2:S) PROD(cons(x:S,l:S)) -> *#(x:S,prod(l:S)) PROD(cons(x:S,l:S)) -> PROD(l:S) SUM(app(l1:S,l2:S)) -> +#(sum(l1:S),sum(l2:S)) SUM(app(l1:S,l2:S)) -> SUM(l1:S) SUM(app(l1:S,l2:S)) -> SUM(l2:S) SUM(cons(x:S,l:S)) -> +#(x:S,sum(l:S)) SUM(cons(x:S,l:S)) -> SUM(l:S) -> Rules: *(*(x:S,y:S),z:S) -> *(x:S,*(y:S,z:S)) *(0,x:S) -> 0 *(s(x:S),s(y:S)) -> s(+(*(x:S,y:S),+(x:S,y:S))) *(x:S,0) -> 0 +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(0,x:S) -> x:S +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(x:S,0) -> x:S app(cons(x:S,l1:S),l2:S) -> cons(x:S,app(l1:S,l2:S)) app(nil,l:S) -> l:S prod(app(l1:S,l2:S)) -> *(prod(l1:S),prod(l2:S)) prod(cons(x:S,l:S)) -> *(x:S,prod(l:S)) prod(nil) -> s(0) sum(app(l1:S,l2:S)) -> +(sum(l1:S),sum(l2:S)) sum(cons(x:S,l:S)) -> +(x:S,sum(l:S)) sum(nil) -> 0 Problem 1: SCC Processor: -> Pairs: *#(*(x:S,y:S),z:S) -> *#(x:S,*(y:S,z:S)) *#(*(x:S,y:S),z:S) -> *#(y:S,z:S) *#(s(x:S),s(y:S)) -> *#(x:S,y:S) *#(s(x:S),s(y:S)) -> +#(*(x:S,y:S),+(x:S,y:S)) *#(s(x:S),s(y:S)) -> +#(x:S,y:S) +#(+(x:S,y:S),z:S) -> +#(x:S,+(y:S,z:S)) +#(+(x:S,y:S),z:S) -> +#(y:S,z:S) +#(s(x:S),s(y:S)) -> +#(x:S,y:S) APP(cons(x:S,l1:S),l2:S) -> APP(l1:S,l2:S) PROD(app(l1:S,l2:S)) -> *#(prod(l1:S),prod(l2:S)) PROD(app(l1:S,l2:S)) -> PROD(l1:S) PROD(app(l1:S,l2:S)) -> PROD(l2:S) PROD(cons(x:S,l:S)) -> *#(x:S,prod(l:S)) PROD(cons(x:S,l:S)) -> PROD(l:S) SUM(app(l1:S,l2:S)) -> +#(sum(l1:S),sum(l2:S)) SUM(app(l1:S,l2:S)) -> SUM(l1:S) SUM(app(l1:S,l2:S)) -> SUM(l2:S) SUM(cons(x:S,l:S)) -> +#(x:S,sum(l:S)) SUM(cons(x:S,l:S)) -> SUM(l:S) -> Rules: *(*(x:S,y:S),z:S) -> *(x:S,*(y:S,z:S)) *(0,x:S) -> 0 *(s(x:S),s(y:S)) -> s(+(*(x:S,y:S),+(x:S,y:S))) *(x:S,0) -> 0 +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(0,x:S) -> x:S +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(x:S,0) -> x:S app(cons(x:S,l1:S),l2:S) -> cons(x:S,app(l1:S,l2:S)) app(nil,l:S) -> l:S prod(app(l1:S,l2:S)) -> *(prod(l1:S),prod(l2:S)) popout

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

job log

popout

actions

all output return to TRS Standard