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	n174.star.cs.uiowa.edu
space	Secret_07_TRS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0585319 seconds
cpu usage	0.053855
user time	0.03389
system time	0.019965
max virtual memory	113188.0
max residence set size	9308.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S k:S l:S x:S y:S z:S) (RULES +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(h,x:S) -> x:S +(x:S,h) -> x:S a(s(l:S),h,h,z:S) -> a(l:S,z:S,h,z:S) a(h,h,h,x:S) -> s(x:S) a(l:S,s(x:S),h,z:S) -> a(l:S,x:S,z:S,z:S) a(l:S,x:S,s(y:S),s(z:S)) -> a(l:S,x:S,y:S,a(l:S,x:S,s(y:S),z:S)) a(l:S,x:S,s(y:S),h) -> a(l:S,x:S,y:S,s(h)) app(cons(x:S,l:S),k:S) -> cons(x:S,app(l:S,k:S)) app(nil,k:S) -> k:S app(l:S,nil) -> l:S s(h) -> 1 sum(cons(x:S,cons(y:S,l:S))) -> sum(cons(a(x:S,y:S,h,h),l:S)) sum(cons(x:S,nil)) -> cons(x:S,nil) ) 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)) -> S(+(x:S,y:S)) +#(s(x:S),s(y:S)) -> S(s(+(x:S,y:S))) A(s(l:S),h,h,z:S) -> A(l:S,z:S,h,z:S) A(h,h,h,x:S) -> S(x:S) A(l:S,s(x:S),h,z:S) -> A(l:S,x:S,z:S,z:S) A(l:S,x:S,s(y:S),s(z:S)) -> A(l:S,x:S,s(y:S),z:S) A(l:S,x:S,s(y:S),s(z:S)) -> A(l:S,x:S,y:S,a(l:S,x:S,s(y:S),z:S)) A(l:S,x:S,s(y:S),h) -> A(l:S,x:S,y:S,s(h)) A(l:S,x:S,s(y:S),h) -> S(h) APP(cons(x:S,l:S),k:S) -> APP(l:S,k:S) SUM(cons(x:S,cons(y:S,l:S))) -> A(x:S,y:S,h,h) SUM(cons(x:S,cons(y:S,l:S))) -> SUM(cons(a(x:S,y:S,h,h),l:S)) -> Rules: +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(h,x:S) -> x:S +(x:S,h) -> x:S a(s(l:S),h,h,z:S) -> a(l:S,z:S,h,z:S) a(h,h,h,x:S) -> s(x:S) a(l:S,s(x:S),h,z:S) -> a(l:S,x:S,z:S,z:S) a(l:S,x:S,s(y:S),s(z:S)) -> a(l:S,x:S,y:S,a(l:S,x:S,s(y:S),z:S)) a(l:S,x:S,s(y:S),h) -> a(l:S,x:S,y:S,s(h)) app(cons(x:S,l:S),k:S) -> cons(x:S,app(l:S,k:S)) app(nil,k:S) -> k:S app(l:S,nil) -> l:S s(h) -> 1 sum(cons(x:S,cons(y:S,l:S))) -> sum(cons(a(x:S,y:S,h,h),l:S)) sum(cons(x:S,nil)) -> cons(x:S,nil) 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)) -> S(+(x:S,y:S)) +#(s(x:S),s(y:S)) -> S(s(+(x:S,y:S))) A(s(l:S),h,h,z:S) -> A(l:S,z:S,h,z:S) A(h,h,h,x:S) -> S(x:S) A(l:S,s(x:S),h,z:S) -> A(l:S,x:S,z:S,z:S) A(l:S,x:S,s(y:S),s(z:S)) -> A(l:S,x:S,s(y:S),z:S) A(l:S,x:S,s(y:S),s(z:S)) -> A(l:S,x:S,y:S,a(l:S,x:S,s(y:S),z:S)) A(l:S,x:S,s(y:S),h) -> A(l:S,x:S,y:S,s(h)) A(l:S,x:S,s(y:S),h) -> S(h) APP(cons(x:S,l:S),k:S) -> APP(l:S,k:S) SUM(cons(x:S,cons(y:S,l:S))) -> A(x:S,y:S,h,h) SUM(cons(x:S,cons(y:S,l:S))) -> SUM(cons(a(x:S,y:S,h,h),l:S)) -> Rules: +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(s(x:S),s(y:S)) -> s(s(+(x:S,y:S))) +(h,x:S) -> x:S +(x:S,h) -> x:S a(s(l:S),h,h,z:S) -> a(l:S,z:S,h,z:S) a(h,h,h,x:S) -> s(x:S) a(l:S,s(x:S),h,z:S) -> a(l:S,x:S,z:S,z:S) a(l:S,x:S,s(y:S),s(z:S)) -> a(l:S,x:S,y:S,a(l:S,x:S,s(y:S),z:S)) a(l:S,x:S,s(y:S),h) -> a(l:S,x:S,y:S,s(h)) app(cons(x:S,l:S),k:S) -> cons(x:S,app(l:S,k:S)) app(nil,k:S) -> k:S app(l:S,nil) -> l:S s(h) -> 1 sum(cons(x:S,cons(y:S,l:S))) -> sum(cons(a(x:S,y:S,h,h),l:S)) sum(cons(x:S,nil)) -> cons(x:S,nil) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(cons(x:S,l:S),k:S) -> APP(l:S,k:S) ->->-> Rules: +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) popout

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

job log

popout

actions

all output return to TRS Standard