details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.096029 seconds
cpu usage	0.100705
user time	0.070094
system time	0.030611
max virtual memory	113188.0
max residence set size	6820.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES 0(ql(x1:S)) -> ql(0(x1:S)) 0(qr(x1:S)) -> qr(0(x1:S)) 1(ql(x1:S)) -> ql(1(x1:S)) 1(qr(x1:S)) -> qr(1(x1:S)) b(ql(0(x1:S))) -> 0(b(r0(x1:S))) b(ql(1(x1:S))) -> 1(b(r1(x1:S))) m(qr(x1:S)) -> ql(m(x1:S)) r0(0(x1:S)) -> 0(r0(x1:S)) r0(1(x1:S)) -> 1(r0(x1:S)) r0(b(x1:S)) -> qr(0(b(x1:S))) r0(m(x1:S)) -> m(r0(x1:S)) r1(0(x1:S)) -> 0(r1(x1:S)) r1(1(x1:S)) -> 1(r1(x1:S)) r1(b(x1:S)) -> qr(1(b(x1:S))) r1(m(x1:S)) -> m(r1(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: 0#(ql(x1:S)) -> 0#(x1:S) 0#(qr(x1:S)) -> 0#(x1:S) 1#(ql(x1:S)) -> 1#(x1:S) 1#(qr(x1:S)) -> 1#(x1:S) B(ql(0(x1:S))) -> 0#(b(r0(x1:S))) B(ql(0(x1:S))) -> B(r0(x1:S)) B(ql(0(x1:S))) -> R0(x1:S) B(ql(1(x1:S))) -> 1#(b(r1(x1:S))) B(ql(1(x1:S))) -> B(r1(x1:S)) B(ql(1(x1:S))) -> R1(x1:S) M(qr(x1:S)) -> M(x1:S) R0(0(x1:S)) -> 0#(r0(x1:S)) R0(0(x1:S)) -> R0(x1:S) R0(1(x1:S)) -> 1#(r0(x1:S)) R0(1(x1:S)) -> R0(x1:S) R0(b(x1:S)) -> 0#(b(x1:S)) R0(m(x1:S)) -> M(r0(x1:S)) R0(m(x1:S)) -> R0(x1:S) R1(0(x1:S)) -> 0#(r1(x1:S)) R1(0(x1:S)) -> R1(x1:S) R1(1(x1:S)) -> 1#(r1(x1:S)) R1(1(x1:S)) -> R1(x1:S) R1(b(x1:S)) -> 1#(b(x1:S)) R1(m(x1:S)) -> M(r1(x1:S)) R1(m(x1:S)) -> R1(x1:S) -> Rules: 0(ql(x1:S)) -> ql(0(x1:S)) 0(qr(x1:S)) -> qr(0(x1:S)) 1(ql(x1:S)) -> ql(1(x1:S)) 1(qr(x1:S)) -> qr(1(x1:S)) b(ql(0(x1:S))) -> 0(b(r0(x1:S))) b(ql(1(x1:S))) -> 1(b(r1(x1:S))) m(qr(x1:S)) -> ql(m(x1:S)) r0(0(x1:S)) -> 0(r0(x1:S)) r0(1(x1:S)) -> 1(r0(x1:S)) r0(b(x1:S)) -> qr(0(b(x1:S))) r0(m(x1:S)) -> m(r0(x1:S)) r1(0(x1:S)) -> 0(r1(x1:S)) r1(1(x1:S)) -> 1(r1(x1:S)) r1(b(x1:S)) -> qr(1(b(x1:S))) r1(m(x1:S)) -> m(r1(x1:S)) Problem 1: SCC Processor: -> Pairs: 0#(ql(x1:S)) -> 0#(x1:S) 0#(qr(x1:S)) -> 0#(x1:S) 1#(ql(x1:S)) -> 1#(x1:S) 1#(qr(x1:S)) -> 1#(x1:S) B(ql(0(x1:S))) -> 0#(b(r0(x1:S))) B(ql(0(x1:S))) -> B(r0(x1:S)) B(ql(0(x1:S))) -> R0(x1:S) B(ql(1(x1:S))) -> 1#(b(r1(x1:S))) B(ql(1(x1:S))) -> B(r1(x1:S)) B(ql(1(x1:S))) -> R1(x1:S) M(qr(x1:S)) -> M(x1:S) R0(0(x1:S)) -> 0#(r0(x1:S)) R0(0(x1:S)) -> R0(x1:S) R0(1(x1:S)) -> 1#(r0(x1:S)) R0(1(x1:S)) -> R0(x1:S) R0(b(x1:S)) -> 0#(b(x1:S)) R0(m(x1:S)) -> M(r0(x1:S)) R0(m(x1:S)) -> R0(x1:S) R1(0(x1:S)) -> 0#(r1(x1:S)) R1(0(x1:S)) -> R1(x1:S) R1(1(x1:S)) -> 1#(r1(x1:S)) R1(1(x1:S)) -> R1(x1:S) R1(b(x1:S)) -> 1#(b(x1:S)) R1(m(x1:S)) -> M(r1(x1:S)) R1(m(x1:S)) -> R1(x1:S) -> Rules: 0(ql(x1:S)) -> ql(0(x1:S)) popout

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

job log

popout

actions

all output return to SRS Standard