Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711588
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
n051.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0230829715729 seconds
cpu usage
0.019651046
max memory
2351104.0
stage attributes
key
value
output-size
11172
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 l1 l2 x y z) (RULES *(*(x,y),z) -> *(x,*(y,z)) *(0,x) -> 0 *(s(x),s(y)) -> s(+(*(x,y),+(x,y))) *(x,0) -> 0 +(+(x,y),z) -> +(x,+(y,z)) +(0,x) -> x +(s(x),s(y)) -> s(s(+(x,y))) +(x,0) -> x app(cons(x,l1),l2) -> cons(x,app(l1,l2)) app(nil,l) -> l prod(app(l1,l2)) -> *(prod(l1),prod(l2)) prod(cons(x,l)) -> *(x,prod(l)) prod(nil) -> s(0) sum(app(l1,l2)) -> +(sum(l1),sum(l2)) 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) *#(s(x),s(y)) -> *#(x,y) *#(s(x),s(y)) -> +#(*(x,y),+(x,y)) *#(s(x),s(y)) -> +#(x,y) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) +#(s(x),s(y)) -> +#(x,y) APP(cons(x,l1),l2) -> APP(l1,l2) PROD(app(l1,l2)) -> *#(prod(l1),prod(l2)) PROD(app(l1,l2)) -> PROD(l1) PROD(app(l1,l2)) -> PROD(l2) PROD(cons(x,l)) -> *#(x,prod(l)) PROD(cons(x,l)) -> PROD(l) SUM(app(l1,l2)) -> +#(sum(l1),sum(l2)) SUM(app(l1,l2)) -> SUM(l1) SUM(app(l1,l2)) -> SUM(l2) SUM(cons(x,l)) -> +#(x,sum(l)) SUM(cons(x,l)) -> SUM(l) -> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(0,x) -> 0 *(s(x),s(y)) -> s(+(*(x,y),+(x,y))) *(x,0) -> 0 +(+(x,y),z) -> +(x,+(y,z)) +(0,x) -> x +(s(x),s(y)) -> s(s(+(x,y))) +(x,0) -> x app(cons(x,l1),l2) -> cons(x,app(l1,l2)) app(nil,l) -> l prod(app(l1,l2)) -> *(prod(l1),prod(l2)) prod(cons(x,l)) -> *(x,prod(l)) prod(nil) -> s(0) sum(app(l1,l2)) -> +(sum(l1),sum(l2)) 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) *#(s(x),s(y)) -> *#(x,y) *#(s(x),s(y)) -> +#(*(x,y),+(x,y)) *#(s(x),s(y)) -> +#(x,y) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) +#(s(x),s(y)) -> +#(x,y) APP(cons(x,l1),l2) -> APP(l1,l2) PROD(app(l1,l2)) -> *#(prod(l1),prod(l2)) PROD(app(l1,l2)) -> PROD(l1) PROD(app(l1,l2)) -> PROD(l2) PROD(cons(x,l)) -> *#(x,prod(l)) PROD(cons(x,l)) -> PROD(l) SUM(app(l1,l2)) -> +#(sum(l1),sum(l2)) SUM(app(l1,l2)) -> SUM(l1) SUM(app(l1,l2)) -> SUM(l2) SUM(cons(x,l)) -> +#(x,sum(l)) SUM(cons(x,l)) -> SUM(l) -> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(0,x) -> 0 *(s(x),s(y)) -> s(+(*(x,y),+(x,y))) *(x,0) -> 0 +(+(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