Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712414
details
property
value
status
complete
benchmark
secret4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0512180328369 seconds
cpu usage
0.041937198
max memory
4165632.0
stage attributes
key
value
output-size
14725
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR k l x y z) (RULES +(+(x,y),z) -> +(x,+(y,z)) +(s(x),s(y)) -> s(s(+(x,y))) +(h,x) -> x +(x,h) -> x a(s(l),h,h,z) -> a(l,z,h,z) a(h,h,h,x) -> s(x) a(l,s(x),h,z) -> a(l,x,z,z) a(l,x,s(y),s(z)) -> a(l,x,y,a(l,x,s(y),z)) a(l,x,s(y),h) -> a(l,x,y,s(h)) app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l s(h) -> 1 sum(cons(x,cons(y,l))) -> sum(cons(a(x,y,h,h),l)) sum(cons(x,nil)) -> cons(x,nil) ) 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)) -> S(+(x,y)) +#(s(x),s(y)) -> S(s(+(x,y))) A(s(l),h,h,z) -> A(l,z,h,z) A(h,h,h,x) -> S(x) A(l,s(x),h,z) -> A(l,x,z,z) A(l,x,s(y),s(z)) -> A(l,x,s(y),z) A(l,x,s(y),s(z)) -> A(l,x,y,a(l,x,s(y),z)) A(l,x,s(y),h) -> A(l,x,y,s(h)) A(l,x,s(y),h) -> S(h) APP(cons(x,l),k) -> APP(l,k) SUM(cons(x,cons(y,l))) -> A(x,y,h,h) SUM(cons(x,cons(y,l))) -> SUM(cons(a(x,y,h,h),l)) -> Rules: +(+(x,y),z) -> +(x,+(y,z)) +(s(x),s(y)) -> s(s(+(x,y))) +(h,x) -> x +(x,h) -> x a(s(l),h,h,z) -> a(l,z,h,z) a(h,h,h,x) -> s(x) a(l,s(x),h,z) -> a(l,x,z,z) a(l,x,s(y),s(z)) -> a(l,x,y,a(l,x,s(y),z)) a(l,x,s(y),h) -> a(l,x,y,s(h)) app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l s(h) -> 1 sum(cons(x,cons(y,l))) -> sum(cons(a(x,y,h,h),l)) sum(cons(x,nil)) -> cons(x,nil) 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)) -> S(+(x,y)) +#(s(x),s(y)) -> S(s(+(x,y))) A(s(l),h,h,z) -> A(l,z,h,z) A(h,h,h,x) -> S(x) A(l,s(x),h,z) -> A(l,x,z,z) A(l,x,s(y),s(z)) -> A(l,x,s(y),z) A(l,x,s(y),s(z)) -> A(l,x,y,a(l,x,s(y),z)) A(l,x,s(y),h) -> A(l,x,y,s(h)) A(l,x,s(y),h) -> S(h) APP(cons(x,l),k) -> APP(l,k) SUM(cons(x,cons(y,l))) -> A(x,y,h,h) SUM(cons(x,cons(y,l))) -> SUM(cons(a(x,y,h,h),l)) -> Rules: +(+(x,y),z) -> +(x,+(y,z)) +(s(x),s(y)) -> s(s(+(x,y))) +(h,x) -> x +(x,h) -> x a(s(l),h,h,z) -> a(l,z,h,z) a(h,h,h,x) -> s(x) a(l,s(x),h,z) -> a(l,x,z,z) a(l,x,s(y),s(z)) -> a(l,x,y,a(l,x,s(y),z)) a(l,x,s(y),h) -> a(l,x,y,s(h)) app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l s(h) -> 1 sum(cons(x,cons(y,l))) -> sum(cons(a(x,y,h,h),l)) sum(cons(x,nil)) -> cons(x,nil)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472