details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	3.73896098137 seconds
cpu usage	8.797662084
max memory	1.651970048E9

stage attributes

key	value
output-size	26647
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 { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 2-rule system { 0 0 0 0 ⟶ 1 0 0 1 , 0 1 0 1 ⟶ 0 0 1 0 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↓) ↦ 2 }, it remains to prove termination of the 7-rule system { 0 1 1 1 ⟶ 0 1 2 , 0 1 1 1 ⟶ 0 2 , 0 2 1 2 ⟶ 0 1 2 1 , 0 2 1 2 ⟶ 0 2 1 , 0 2 1 2 ⟶ 0 , 1 1 1 1 →= 2 1 1 2 , 1 2 1 2 →= 1 1 2 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 2 ↦ 1, 1 ↦ 2 }, it remains to prove termination of the 3-rule system { 0 1 2 1 ⟶ 0 2 1 2 , 2 2 2 2 →= 1 2 2 1 , 2 1 2 1 →= 2 2 1 2 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (3,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (2,1) ↦ 3, (1,1) ↦ 4, (0,2) ↦ 5, (2,2) ↦ 6, (1,4) ↦ 7, (2,4) ↦ 8, (3,2) ↦ 9, (3,1) ↦ 10 }, it remains to prove termination of the 27-rule system { 0 1 2 3 4 ⟶ 0 5 3 2 3 , 0 1 2 3 2 ⟶ 0 5 3 2 6 , 0 1 2 3 7 ⟶ 0 5 3 2 8 , 5 6 6 6 3 →= 1 2 6 3 4 , 5 6 6 6 6 →= 1 2 6 3 2 , 5 6 6 6 8 →= 1 2 6 3 7 , 2 6 6 6 3 →= 4 2 6 3 4 , 2 6 6 6 6 →= 4 2 6 3 2 , 2 6 6 6 8 →= 4 2 6 3 7 , 6 6 6 6 3 →= 3 2 6 3 4 , 6 6 6 6 6 →= 3 2 6 3 2 , 6 6 6 6 8 →= 3 2 6 3 7 , 9 6 6 6 3 →= 10 2 6 3 4 , 9 6 6 6 6 →= 10 2 6 3 2 , 9 6 6 6 8 →= 10 2 6 3 7 , 5 3 2 3 4 →= 5 6 3 2 3 , 5 3 2 3 2 →= 5 6 3 2 6 , 5 3 2 3 7 →= 5 6 3 2 8 , 2 3 2 3 4 →= 2 6 3 2 3 , 2 3 2 3 2 →= 2 6 3 2 6 , 2 3 2 3 7 →= 2 6 3 2 8 , 6 3 2 3 4 →= 6 6 3 2 3 , 6 3 2 3 2 →= 6 6 3 2 6 , 6 3 2 3 7 →= 6 6 3 2 8 , 9 3 2 3 4 →= 9 6 3 2 3 , 9 3 2 3 2 →= 9 6 3 2 6 , 9 3 2 3 7 →= 9 6 3 2 8 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ popout

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

job log

popout

actions

all output return to SRS Standard