details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	2.85307812691 seconds
cpu usage	9.540253134
max memory	2.5455616E9

stage attributes

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

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

job log

popout

actions

all output return to SRS Standard