details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.815709114075 seconds
cpu usage	1.713502089
max memory	5.58317568E8

stage attributes

key	value
output-size	2250
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 { b ↦ 0, a ↦ 1 }, it remains to prove termination of the 3-rule system { 0 1 1 0 ⟶ 0 0 0 0 , 0 0 0 1 ⟶ 0 0 0 0 , 1 0 0 0 ⟶ 0 1 1 1 } The length-preserving system was inverted. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 3-rule system { 0 0 0 0 ⟶ 0 1 1 0 , 0 0 0 0 ⟶ 0 0 0 1 , 0 1 1 1 ⟶ 1 0 0 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 10-rule system { 0 1 1 1 ⟶ 0 2 2 1 , 0 1 1 1 ⟶ 0 1 1 2 , 0 1 1 1 ⟶ 0 1 2 , 0 1 1 1 ⟶ 0 2 , 0 2 2 2 ⟶ 0 1 1 , 0 2 2 2 ⟶ 0 1 , 0 2 2 2 ⟶ 0 , 1 1 1 1 →= 1 2 2 1 , 1 1 1 1 →= 1 1 1 2 , 1 2 2 2 →= 2 1 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 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2 }, it remains to prove termination of the 5-rule system { 0 1 1 1 ⟶ 0 2 2 1 , 0 1 1 1 ⟶ 0 1 1 2 , 1 1 1 1 →= 1 2 2 1 , 1 1 1 1 →= 1 1 1 2 , 1 2 2 2 →= 2 1 1 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 5: 0 ↦ ⎛ ⎞ ⎜ 1 0 1 0 0 ⎟ ⎜ 0 1 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 1 0 0 0 ⎟ ⎜ 0 0 0 1 0 ⎟ ⎜ 0 0 0 0 1 ⎟ ⎜ 0 1 0 0 0 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 0 0 0 ⎟ ⎜ 0 1 0 0 0 ⎟ ⎜ 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 ⎟ ⎜ 0 0 0 0 0 ⎟ ⎝ ⎠ After renaming modulo the bijection { 1 ↦ 0, 2 ↦ 1 }, it remains to prove termination of the 3-rule system { 0 0 0 0 →= 0 1 1 0 , 0 0 0 0 →= 0 0 0 1 , 0 1 1 1 →= 1 0 0 0 } 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