SRS Stand 10685 pair #381718589

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	n075.star.cs.uiowa.edu
space	Mixed_SRS

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.111673116684 seconds
cpu usage	0.116020261
max memory	4472832.0

stage attributes

key	value
output-size	10068
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(q1(x1)) -> q2(1(x1))
0(q2(x1)) -> 0(q0(x1))
1(q0(0(x1))) -> 0(0(q1(x1)))
1(q0(1(x1))) -> 0(1(q1(x1)))
1(q1(0(x1))) -> 1(0(q1(x1)))
1(q1(1(x1))) -> 1(1(q1(x1)))
1(q2(x1)) -> q2(1(x1))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 0#(q1(x1)) -> 1#(x1)
 1#(q0(0(x1))) -> 0#(0(q1(x1)))
 1#(q0(0(x1))) -> 0#(q1(x1))
 1#(q0(1(x1))) -> 0#(1(q1(x1)))
 1#(q0(1(x1))) -> 1#(q1(x1))
 1#(q1(0(x1))) -> 0#(q1(x1))
 1#(q1(0(x1))) -> 1#(0(q1(x1)))
 1#(q1(1(x1))) -> 1#(1(q1(x1)))
 1#(q1(1(x1))) -> 1#(q1(x1))
 1#(q2(x1)) -> 1#(x1)
-> Rules:
 0(q1(x1)) -> q2(1(x1))
 0(q2(x1)) -> 0(q0(x1))
 1(q0(0(x1))) -> 0(0(q1(x1)))
 1(q0(1(x1))) -> 0(1(q1(x1)))
 1(q1(0(x1))) -> 1(0(q1(x1)))
 1(q1(1(x1))) -> 1(1(q1(x1)))
 1(q2(x1)) -> q2(1(x1))

Problem 1: 

SCC Processor:
-> Pairs:
 0#(q1(x1)) -> 1#(x1)
 1#(q0(0(x1))) -> 0#(0(q1(x1)))
 1#(q0(0(x1))) -> 0#(q1(x1))
 1#(q0(1(x1))) -> 0#(1(q1(x1)))
 1#(q0(1(x1))) -> 1#(q1(x1))
 1#(q1(0(x1))) -> 0#(q1(x1))
 1#(q1(0(x1))) -> 1#(0(q1(x1)))
 1#(q1(1(x1))) -> 1#(1(q1(x1)))
 1#(q1(1(x1))) -> 1#(q1(x1))
 1#(q2(x1)) -> 1#(x1)
-> Rules:
 0(q1(x1)) -> q2(1(x1))
 0(q2(x1)) -> 0(q0(x1))
 1(q0(0(x1))) -> 0(0(q1(x1)))
 1(q0(1(x1))) -> 0(1(q1(x1)))
 1(q1(0(x1))) -> 1(0(q1(x1)))
 1(q1(1(x1))) -> 1(1(q1(x1)))
 1(q2(x1)) -> q2(1(x1))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 0#(q1(x1)) -> 1#(x1)
 1#(q0(0(x1))) -> 0#(0(q1(x1)))
 1#(q0(0(x1))) -> 0#(q1(x1))
 1#(q0(1(x1))) -> 0#(1(q1(x1)))
 1#(q0(1(x1))) -> 1#(q1(x1))
 1#(q1(0(x1))) -> 0#(q1(x1))
 1#(q1(0(x1))) -> 1#(0(q1(x1)))
 1#(q1(1(x1))) -> 1#(1(q1(x1)))
 1#(q1(1(x1))) -> 1#(q1(x1))
 1#(q2(x1)) -> 1#(x1)
->->-> Rules:
 0(q1(x1)) -> q2(1(x1))
 0(q2(x1)) -> 0(q0(x1))
 1(q0(0(x1))) -> 0(0(q1(x1)))
 1(q0(1(x1))) -> 0(1(q1(x1)))
 1(q1(0(x1))) -> 1(0(q1(x1)))
 1(q1(1(x1))) -> 1(1(q1(x1)))
 1(q2(x1)) -> q2(1(x1))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 0#(q1(x1)) -> 1#(x1)
 1#(q0(0(x1))) -> 0#(0(q1(x1)))
 1#(q0(0(x1))) -> 0#(q1(x1))
 1#(q0(1(x1))) -> 0#(1(q1(x1)))
 1#(q0(1(x1))) -> 1#(q1(x1))
 1#(q1(0(x1))) -> 0#(q1(x1))
 1#(q1(0(x1))) -> 1#(0(q1(x1)))
 1#(q1(1(x1))) -> 1#(1(q1(x1)))

popout

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

job log

popout

actions all output return to SRS Stand 10685