details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.35584 seconds
cpu usage	0.380013
user time	0.254061
system time	0.125952
max virtual memory	113188.0
max residence set size	7096.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES #(#(#(#(x1:S)))) -> #(#(x1:S)) #(#(0(0(x1:S)))) -> 0(0(#(#(x1:S)))) #(#(1(1(x1:S)))) -> 1(1(#(#(x1:S)))) #(#($($(x1:S)))) -> *(*($($(x1:S)))) #(#(*(*(x1:S)))) -> *(*(x1:S)) 0(0(*(*(x1:S)))) -> *(*(1(1(x1:S)))) 1(1(*(*(x1:S)))) -> 0(0(#(#(x1:S)))) ) Problem 1: Dependency Pairs Processor: -> Pairs: ##(#(0(0(x1:S)))) -> ##(#(x1:S)) ##(#(0(0(x1:S)))) -> ##(x1:S) ##(#(0(0(x1:S)))) -> 0#(#(#(x1:S))) ##(#(0(0(x1:S)))) -> 0#(0(#(#(x1:S)))) ##(#(1(1(x1:S)))) -> ##(#(x1:S)) ##(#(1(1(x1:S)))) -> ##(x1:S) ##(#(1(1(x1:S)))) -> 1#(#(#(x1:S))) ##(#(1(1(x1:S)))) -> 1#(1(#(#(x1:S)))) 0#(0(*(*(x1:S)))) -> 1#(1(x1:S)) 0#(0(*(*(x1:S)))) -> 1#(x1:S) 1#(1(*(*(x1:S)))) -> ##(#(x1:S)) 1#(1(*(*(x1:S)))) -> ##(x1:S) 1#(1(*(*(x1:S)))) -> 0#(#(#(x1:S))) 1#(1(*(*(x1:S)))) -> 0#(0(#(#(x1:S)))) -> Rules: #(#(#(#(x1:S)))) -> #(#(x1:S)) #(#(0(0(x1:S)))) -> 0(0(#(#(x1:S)))) #(#(1(1(x1:S)))) -> 1(1(#(#(x1:S)))) #(#($($(x1:S)))) -> *(*($($(x1:S)))) #(#(*(*(x1:S)))) -> *(*(x1:S)) 0(0(*(*(x1:S)))) -> *(*(1(1(x1:S)))) 1(1(*(*(x1:S)))) -> 0(0(#(#(x1:S)))) Problem 1: SCC Processor: -> Pairs: ##(#(0(0(x1:S)))) -> ##(#(x1:S)) ##(#(0(0(x1:S)))) -> ##(x1:S) ##(#(0(0(x1:S)))) -> 0#(#(#(x1:S))) ##(#(0(0(x1:S)))) -> 0#(0(#(#(x1:S)))) ##(#(1(1(x1:S)))) -> ##(#(x1:S)) ##(#(1(1(x1:S)))) -> ##(x1:S) ##(#(1(1(x1:S)))) -> 1#(#(#(x1:S))) ##(#(1(1(x1:S)))) -> 1#(1(#(#(x1:S)))) 0#(0(*(*(x1:S)))) -> 1#(1(x1:S)) 0#(0(*(*(x1:S)))) -> 1#(x1:S) 1#(1(*(*(x1:S)))) -> ##(#(x1:S)) 1#(1(*(*(x1:S)))) -> ##(x1:S) 1#(1(*(*(x1:S)))) -> 0#(#(#(x1:S))) 1#(1(*(*(x1:S)))) -> 0#(0(#(#(x1:S)))) -> Rules: #(#(#(#(x1:S)))) -> #(#(x1:S)) #(#(0(0(x1:S)))) -> 0(0(#(#(x1:S)))) #(#(1(1(x1:S)))) -> 1(1(#(#(x1:S)))) #(#($($(x1:S)))) -> *(*($($(x1:S)))) #(#(*(*(x1:S)))) -> *(*(x1:S)) 0(0(*(*(x1:S)))) -> *(*(1(1(x1:S)))) 1(1(*(*(x1:S)))) -> 0(0(#(#(x1:S)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ##(#(0(0(x1:S)))) -> ##(#(x1:S)) ##(#(0(0(x1:S)))) -> ##(x1:S) ##(#(0(0(x1:S)))) -> 0#(#(#(x1:S))) ##(#(0(0(x1:S)))) -> 0#(0(#(#(x1:S)))) ##(#(1(1(x1:S)))) -> ##(#(x1:S)) ##(#(1(1(x1:S)))) -> ##(x1:S) ##(#(1(1(x1:S)))) -> 1#(#(#(x1:S))) ##(#(1(1(x1:S)))) -> 1#(1(#(#(x1:S)))) 0#(0(*(*(x1:S)))) -> 1#(1(x1:S)) 0#(0(*(*(x1:S)))) -> 1#(x1:S) 1#(1(*(*(x1:S)))) -> ##(#(x1:S)) 1#(1(*(*(x1:S)))) -> ##(x1:S) 1#(1(*(*(x1:S)))) -> 0#(#(#(x1:S))) 1#(1(*(*(x1:S)))) -> 0#(0(#(#(x1:S)))) ->->-> Rules: #(#(#(#(x1:S)))) -> #(#(x1:S)) #(#(0(0(x1:S)))) -> 0(0(#(#(x1:S)))) #(#(1(1(x1:S)))) -> 1(1(#(#(x1:S)))) #(#($($(x1:S)))) -> *(*($($(x1:S)))) #(#(*(*(x1:S)))) -> *(*(x1:S)) 0(0(*(*(x1:S)))) -> *(*(1(1(x1:S)))) 1(1(*(*(x1:S)))) -> 0(0(#(#(x1:S)))) Problem 1: Reduction Pair Processor: -> Pairs: ##(#(0(0(x1:S)))) -> ##(#(x1:S)) ##(#(0(0(x1:S)))) -> ##(x1:S) popout

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

job log

popout

actions

all output return to SRS Standard