details

property	value
status	complete
benchmark	random-222.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n063.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	1.11846995354 seconds
cpu usage	1.414597497
max memory	5.41138944E8

stage attributes

key	value
output-size	1425
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 After renaming modulo the bijection { a ↦ 0, b ↦ 1 }, it remains to prove termination of the 3-rule system { 0 1 0 0 ⟶ 0 1 1 1 , 1 1 0 0 ⟶ 0 1 0 1 , 1 0 0 1 ⟶ 1 0 1 0 } The system was reversed. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 3-rule system { 0 0 1 0 ⟶ 1 1 1 0 , 0 0 1 1 ⟶ 1 0 1 0 , 1 0 0 1 ⟶ 0 1 0 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 2-rule system { 0 0 1 1 ⟶ 1 0 1 0 , 1 0 0 1 ⟶ 0 1 0 1 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 1-rule system { 0 1 1 0 ⟶ 1 0 1 0 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { }, it remains to prove termination of the 0-rule system { } The system is trivially terminating. popout

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

job log

popout

actions

all output return to SRS Standard