details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.567490100861 seconds
cpu usage	0.800278729
max memory	3.65297664E8

stage attributes

key	value
output-size	1112
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO After renaming modulo the bijection { 0 ↦ 0, q0 ↦ 1, h ↦ 2, 1 ↦ 3, q1 ↦ 4, q2 ↦ 5, q3 ↦ 6, q4 ↦ 7, q5 ↦ 8 }, it remains to prove termination of the 31-rule system { 0 1 0 ⟶ 0 0 1 , 0 1 2 ⟶ 0 0 1 2 , 0 1 3 ⟶ 0 3 1 , 3 1 0 ⟶ 0 0 4 , 3 1 2 ⟶ 0 0 4 2 , 3 1 3 ⟶ 0 3 4 , 3 4 0 ⟶ 3 0 4 , 3 4 2 ⟶ 3 0 4 2 , 3 4 3 ⟶ 3 3 4 , 0 4 0 ⟶ 0 0 5 , 0 4 2 ⟶ 0 0 5 2 , 0 4 3 ⟶ 0 3 5 , 3 5 0 ⟶ 3 0 5 , 3 5 2 ⟶ 3 0 5 2 , 3 5 3 ⟶ 3 3 5 , 0 5 ⟶ 6 3 , 3 6 ⟶ 6 3 , 0 6 ⟶ 7 0 , 3 7 ⟶ 7 3 , 0 7 0 ⟶ 3 0 8 , 0 7 2 ⟶ 3 0 8 2 , 0 7 3 ⟶ 3 3 8 , 3 8 0 ⟶ 0 0 4 , 3 8 2 ⟶ 0 0 4 2 , 3 8 3 ⟶ 0 3 4 , 2 1 ⟶ 2 0 1 , 2 4 ⟶ 2 0 4 , 2 5 ⟶ 2 0 5 , 2 6 ⟶ 2 0 6 , 2 7 ⟶ 2 0 7 , 2 8 ⟶ 2 0 8 } Loop of length 1 starting with a string of length 3 using right expansion and the encoding { 0 ↦ a, 1 ↦ b, ... }: .abc. rule abc-> aabc at position 0 .aabc. popout

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

job log

popout

actions

all output return to SRS Standard