details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.16150188446 seconds
cpu usage	0.141456113
max memory	4526080.0

stage attributes

key	value
output-size	11128
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES 0(q1(x1:S)) -> q2(1(x1:S)) 0(q2(x1:S)) -> 0(q0(x1:S)) 1(q0(0(x1:S))) -> 0(0(q1(x1:S))) 1(q0(1(x1:S))) -> 0(1(q1(x1:S))) 1(q1(0(x1:S))) -> 1(0(q1(x1:S))) 1(q1(1(x1:S))) -> 1(1(q1(x1:S))) 1(q2(x1:S)) -> q2(1(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: 0#(q1(x1:S)) -> 1#(x1:S) 1#(q0(0(x1:S))) -> 0#(0(q1(x1:S))) 1#(q0(0(x1:S))) -> 0#(q1(x1:S)) 1#(q0(1(x1:S))) -> 0#(1(q1(x1:S))) 1#(q0(1(x1:S))) -> 1#(q1(x1:S)) 1#(q1(0(x1:S))) -> 0#(q1(x1:S)) 1#(q1(0(x1:S))) -> 1#(0(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(1(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(q1(x1:S)) 1#(q2(x1:S)) -> 1#(x1:S) -> Rules: 0(q1(x1:S)) -> q2(1(x1:S)) 0(q2(x1:S)) -> 0(q0(x1:S)) 1(q0(0(x1:S))) -> 0(0(q1(x1:S))) 1(q0(1(x1:S))) -> 0(1(q1(x1:S))) 1(q1(0(x1:S))) -> 1(0(q1(x1:S))) 1(q1(1(x1:S))) -> 1(1(q1(x1:S))) 1(q2(x1:S)) -> q2(1(x1:S)) Problem 1: SCC Processor: -> Pairs: 0#(q1(x1:S)) -> 1#(x1:S) 1#(q0(0(x1:S))) -> 0#(0(q1(x1:S))) 1#(q0(0(x1:S))) -> 0#(q1(x1:S)) 1#(q0(1(x1:S))) -> 0#(1(q1(x1:S))) 1#(q0(1(x1:S))) -> 1#(q1(x1:S)) 1#(q1(0(x1:S))) -> 0#(q1(x1:S)) 1#(q1(0(x1:S))) -> 1#(0(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(1(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(q1(x1:S)) 1#(q2(x1:S)) -> 1#(x1:S) -> Rules: 0(q1(x1:S)) -> q2(1(x1:S)) 0(q2(x1:S)) -> 0(q0(x1:S)) 1(q0(0(x1:S))) -> 0(0(q1(x1:S))) 1(q0(1(x1:S))) -> 0(1(q1(x1:S))) 1(q1(0(x1:S))) -> 1(0(q1(x1:S))) 1(q1(1(x1:S))) -> 1(1(q1(x1:S))) 1(q2(x1:S)) -> q2(1(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: 0#(q1(x1:S)) -> 1#(x1:S) 1#(q0(0(x1:S))) -> 0#(0(q1(x1:S))) 1#(q0(0(x1:S))) -> 0#(q1(x1:S)) 1#(q0(1(x1:S))) -> 0#(1(q1(x1:S))) 1#(q0(1(x1:S))) -> 1#(q1(x1:S)) 1#(q1(0(x1:S))) -> 0#(q1(x1:S)) 1#(q1(0(x1:S))) -> 1#(0(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(1(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(q1(x1:S)) 1#(q2(x1:S)) -> 1#(x1:S) ->->-> Rules: 0(q1(x1:S)) -> q2(1(x1:S)) 0(q2(x1:S)) -> 0(q0(x1:S)) 1(q0(0(x1:S))) -> 0(0(q1(x1:S))) 1(q0(1(x1:S))) -> 0(1(q1(x1:S))) 1(q1(0(x1:S))) -> 1(0(q1(x1:S))) 1(q1(1(x1:S))) -> 1(1(q1(x1:S))) 1(q2(x1:S)) -> q2(1(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: 0#(q1(x1:S)) -> 1#(x1:S) 1#(q0(0(x1:S))) -> 0#(0(q1(x1:S))) 1#(q0(0(x1:S))) -> 0#(q1(x1:S)) 1#(q0(1(x1:S))) -> 0#(1(q1(x1:S))) 1#(q0(1(x1:S))) -> 1#(q1(x1:S)) 1#(q1(0(x1:S))) -> 0#(q1(x1:S)) 1#(q1(0(x1:S))) -> 1#(0(q1(x1:S))) 1#(q1(1(x1:S))) -> 1#(1(q1(x1:S))) popout

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

job log

popout

actions

all output return to SRS Standard