Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381720472
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
n002.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0956408977509 seconds
cpu usage
0.095890387
max memory
4722688.0
stage attributes
key
value
output-size
14457
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x1) (RULES 0(ql(x1)) -> ql(0(x1)) 0(qr(x1)) -> qr(0(x1)) 1(ql(x1)) -> ql(1(x1)) 1(qr(x1)) -> qr(1(x1)) b(ql(0(x1))) -> 0(b(r0(x1))) b(ql(1(x1))) -> 1(b(r1(x1))) m(qr(x1)) -> ql(m(x1)) r0(0(x1)) -> 0(r0(x1)) r0(1(x1)) -> 1(r0(x1)) r0(b(x1)) -> qr(0(b(x1))) r0(m(x1)) -> m(r0(x1)) r1(0(x1)) -> 0(r1(x1)) r1(1(x1)) -> 1(r1(x1)) r1(b(x1)) -> qr(1(b(x1))) r1(m(x1)) -> m(r1(x1)) ) Problem 1: Dependency Pairs Processor: -> Pairs: 0#(ql(x1)) -> 0#(x1) 0#(qr(x1)) -> 0#(x1) 1#(ql(x1)) -> 1#(x1) 1#(qr(x1)) -> 1#(x1) B(ql(0(x1))) -> 0#(b(r0(x1))) B(ql(0(x1))) -> B(r0(x1)) B(ql(0(x1))) -> R0(x1) B(ql(1(x1))) -> 1#(b(r1(x1))) B(ql(1(x1))) -> B(r1(x1)) B(ql(1(x1))) -> R1(x1) M(qr(x1)) -> M(x1) R0(0(x1)) -> 0#(r0(x1)) R0(0(x1)) -> R0(x1) R0(1(x1)) -> 1#(r0(x1)) R0(1(x1)) -> R0(x1) R0(b(x1)) -> 0#(b(x1)) R0(m(x1)) -> M(r0(x1)) R0(m(x1)) -> R0(x1) R1(0(x1)) -> 0#(r1(x1)) R1(0(x1)) -> R1(x1) R1(1(x1)) -> 1#(r1(x1)) R1(1(x1)) -> R1(x1) R1(b(x1)) -> 1#(b(x1)) R1(m(x1)) -> M(r1(x1)) R1(m(x1)) -> R1(x1) -> Rules: 0(ql(x1)) -> ql(0(x1)) 0(qr(x1)) -> qr(0(x1)) 1(ql(x1)) -> ql(1(x1)) 1(qr(x1)) -> qr(1(x1)) b(ql(0(x1))) -> 0(b(r0(x1))) b(ql(1(x1))) -> 1(b(r1(x1))) m(qr(x1)) -> ql(m(x1)) r0(0(x1)) -> 0(r0(x1)) r0(1(x1)) -> 1(r0(x1)) r0(b(x1)) -> qr(0(b(x1))) r0(m(x1)) -> m(r0(x1)) r1(0(x1)) -> 0(r1(x1)) r1(1(x1)) -> 1(r1(x1)) r1(b(x1)) -> qr(1(b(x1))) r1(m(x1)) -> m(r1(x1)) Problem 1: SCC Processor: -> Pairs: 0#(ql(x1)) -> 0#(x1) 0#(qr(x1)) -> 0#(x1) 1#(ql(x1)) -> 1#(x1) 1#(qr(x1)) -> 1#(x1) B(ql(0(x1))) -> 0#(b(r0(x1))) B(ql(0(x1))) -> B(r0(x1)) B(ql(0(x1))) -> R0(x1) B(ql(1(x1))) -> 1#(b(r1(x1))) B(ql(1(x1))) -> B(r1(x1)) B(ql(1(x1))) -> R1(x1) M(qr(x1)) -> M(x1) R0(0(x1)) -> 0#(r0(x1)) R0(0(x1)) -> R0(x1) R0(1(x1)) -> 1#(r0(x1)) R0(1(x1)) -> R0(x1) R0(b(x1)) -> 0#(b(x1)) R0(m(x1)) -> M(r0(x1)) R0(m(x1)) -> R0(x1) R1(0(x1)) -> 0#(r1(x1)) R1(0(x1)) -> R1(x1) R1(1(x1)) -> 1#(r1(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685