details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.928231954575 seconds
cpu usage	2.140733511
max memory	6.25532928E8

stage attributes

key	value
output-size	2347
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 3-rule system { 0 1 0 1 ⟶ 0 0 1 0 , 1 1 0 0 ⟶ 0 0 0 1 , 0 1 0 0 ⟶ 0 0 1 1 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↓) ↦ 1, (0,↓) ↦ 2, (1,↑) ↦ 3 }, it remains to prove termination of the 15-rule system { 0 1 2 1 ⟶ 0 2 1 2 , 0 1 2 1 ⟶ 0 1 2 , 0 1 2 1 ⟶ 3 2 , 0 1 2 1 ⟶ 0 , 3 1 2 2 ⟶ 0 2 2 1 , 3 1 2 2 ⟶ 0 2 1 , 3 1 2 2 ⟶ 0 1 , 3 1 2 2 ⟶ 3 , 0 1 2 2 ⟶ 0 2 1 1 , 0 1 2 2 ⟶ 0 1 1 , 0 1 2 2 ⟶ 3 1 , 0 1 2 2 ⟶ 3 , 2 1 2 1 →= 2 2 1 2 , 1 1 2 2 →= 2 2 2 1 , 2 1 2 2 →= 2 2 1 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 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 6-rule system { 0 1 2 1 ⟶ 0 2 1 2 , 3 1 2 2 ⟶ 0 2 2 1 , 0 1 2 2 ⟶ 0 2 1 1 , 2 1 2 1 →= 2 2 1 2 , 1 1 2 2 →= 2 2 2 1 , 2 1 2 2 →= 2 2 1 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 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2 }, it remains to prove termination of the 5-rule system { 0 1 2 1 ⟶ 0 2 1 2 , 0 1 2 2 ⟶ 0 2 1 1 , 2 1 2 1 →= 2 2 1 2 , 1 1 2 2 →= 2 2 2 1 , 2 1 2 2 →= 2 2 1 1 } Applying sparse untiling TROCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1 }, popout

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

job log

popout

actions

all output return to SRS Standard