details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.23488 seconds
cpu usage	1.17885
user time	1.05965
system time	0.119204
max virtual memory	708576.0
max residence set size	5852.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(s(0)) -> 0 p(s(s(x:S))) -> s(p(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)) P(s(s(x:S))) -> P(s(x: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(s(0)) -> 0 p(s(s(x:S))) -> s(p(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)) P(s(s(x:S))) -> P(s(x: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(s(0)) -> 0 p(s(s(x:S))) -> s(p(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: P(s(s(x:S))) -> P(s(x: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(s(0)) -> 0 p(s(s(x:S))) -> s(p(s(x:S))) rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) ->->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(s(0)) -> 0 p(s(s(x:S))) -> s(p(s(x:S))) rand(x:S,y:S) -> if(nonZero(x:S),x:S,y:S) random(x:S) -> rand(x:S,0) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: popout

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

job log

popout

actions

all output return to TRS Standard