details

property	value
status	complete
benchmark	abcabbcab-abbcabcabbca.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n086.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	4.14391899109 seconds
cpu usage	14.665850373
max memory	3.65008896E9

stage attributes

key	value
output-size	21220
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo the bijection { a ↦ 0, b ↦ 1, c ↦ 2 }, it remains to prove termination of the 1-rule system { 0 1 2 0 1 1 2 0 1 ⟶ 0 1 1 2 0 1 2 0 1 1 2 0 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (2,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (1,1) ↦ 3, (0,2) ↦ 4, (3,0) ↦ 5 }, it remains to prove termination of the 4-rule system { 0 1 2 0 1 3 2 0 1 3 ⟶ 0 1 3 2 0 1 2 0 1 3 2 0 1 , 0 1 2 0 1 3 2 0 1 2 ⟶ 0 1 3 2 0 1 2 0 1 3 2 0 4 , 5 1 2 0 1 3 2 0 1 3 ⟶ 5 1 3 2 0 1 2 0 1 3 2 0 1 , 5 1 2 0 1 3 2 0 1 2 ⟶ 5 1 3 2 0 1 2 0 1 3 2 0 4 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↓) ↦ 1, (2,↓) ↦ 2, (0,↓) ↦ 3, (3,↓) ↦ 4, (4,↓) ↦ 5, (5,↑) ↦ 6, (5,↓) ↦ 7 }, it remains to prove termination of the 20-rule system { 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 4 2 3 1 2 3 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 2 3 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 4 2 3 1 2 3 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 2 3 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 5 , 6 1 2 3 1 4 2 3 1 4 ⟶ 6 1 4 2 3 1 2 3 1 4 2 3 1 , 6 1 2 3 1 4 2 3 1 4 ⟶ 0 1 2 3 1 4 2 3 1 , 6 1 2 3 1 4 2 3 1 4 ⟶ 0 1 4 2 3 1 , 6 1 2 3 1 4 2 3 1 4 ⟶ 0 1 , 6 1 2 3 1 4 2 3 1 2 ⟶ 6 1 4 2 3 1 2 3 1 4 2 3 5 , 6 1 2 3 1 4 2 3 1 2 ⟶ 0 1 2 3 1 4 2 3 5 , 6 1 2 3 1 4 2 3 1 2 ⟶ 0 1 4 2 3 5 , 6 1 2 3 1 4 2 3 1 2 ⟶ 0 5 , 3 1 2 3 1 4 2 3 1 4 →= 3 1 4 2 3 1 2 3 1 4 2 3 1 , 3 1 2 3 1 4 2 3 1 2 →= 3 1 4 2 3 1 2 3 1 4 2 3 5 , 7 1 2 3 1 4 2 3 1 4 →= 7 1 4 2 3 1 2 3 1 4 2 3 1 , 7 1 2 3 1 4 2 3 1 2 →= 7 1 4 2 3 1 2 3 1 4 2 3 5 } 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 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 6 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 7 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5, 6 ↦ 6, 7 ↦ 7 }, it remains to prove termination of the 14-rule system { 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 4 2 3 1 2 3 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 2 3 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 4 2 3 1 , 0 1 2 3 1 4 2 3 1 4 ⟶ 0 1 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 4 2 3 1 2 3 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 2 3 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 1 4 2 3 5 , 0 1 2 3 1 4 2 3 1 2 ⟶ 0 5 , 6 1 2 3 1 4 2 3 1 4 ⟶ 6 1 4 2 3 1 2 3 1 4 2 3 1 , popout

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

job log

popout

actions

all output return to SRS Standard