details

property	value
status	complete
benchmark	thiemann40.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n186.star.cs.uiowa.edu
space	AProVE_07

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.105427 seconds
cpu usage	0.078337
user time	0.031737
system time	0.0466
max virtual memory	113188.0
max residence set size	5480.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> rand(p(x:S),id_inc(y:S)) nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue p(0) -> 0 p(s(x:S)) -> x:S rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) ) Problem 1: Dependency Pairs Processor: -> Pairs: IF(ttrue,x:S,y:S) -> ID_INC(y:S) IF(ttrue,x:S,y:S) -> P(x:S) IF(ttrue,x:S,y:S) -> RAND(p(x:S),id_inc(y:S)) RAND(x:S,y:S) -> IF(nonZero(x:S),x:S,y:S) RAND(x:S,y:S) -> NONZERO(x:S) RANDOM(x:S) -> RAND(x:S,0) -> Rules: id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> rand(p(x:S),id_inc(y:S)) nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue p(0) -> 0 p(s(x:S)) -> x:S rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) Problem 1: SCC Processor: -> Pairs: IF(ttrue,x:S,y:S) -> ID_INC(y:S) IF(ttrue,x:S,y:S) -> P(x:S) IF(ttrue,x:S,y:S) -> RAND(p(x:S),id_inc(y:S)) RAND(x:S,y:S) -> IF(nonZero(x:S),x:S,y:S) RAND(x:S,y:S) -> NONZERO(x:S) RANDOM(x:S) -> RAND(x:S,0) -> Rules: id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> rand(p(x:S),id_inc(y:S)) nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue p(0) -> 0 p(s(x:S)) -> x:S rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: IF(ttrue,x:S,y:S) -> RAND(p(x:S),id_inc(y:S)) RAND(x:S,y:S) -> IF(nonZero(x:S),x:S,y:S) ->->-> Rules: id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> rand(p(x:S),id_inc(y:S)) nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue p(0) -> 0 p(s(x:S)) -> x:S rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) Problem 1: Reduction Pair Processor: -> Pairs: IF(ttrue,x:S,y:S) -> RAND(p(x:S),id_inc(y:S)) RAND(x:S,y:S) -> IF(nonZero(x:S),x:S,y:S) -> Rules: id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> rand(p(x:S),id_inc(y:S)) nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue p(0) -> 0 p(s(x:S)) -> x:S rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) -> Usable rules: id_inc(x:S) -> s(x:S) id_inc(x:S) -> x:S nonZero(0) -> ffalse nonZero(s(x:S)) -> ttrue popout

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

job log

popout

actions

all output return to TRS Standard