details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	1.25439596176 seconds
cpu usage	3.276491165
max memory	7.22644992E8

stage attributes

key	value
output-size	6252
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 { a ↦ 0, s ↦ 1, b ↦ 2 }, it remains to prove termination of the 4-rule system { 0 0 1 1 ⟶ 1 1 0 0 , 2 2 0 0 2 2 1 1 ⟶ 0 0 2 2 1 1 0 0 , 2 2 0 0 2 2 2 2 ⟶ 0 0 2 2 0 0 2 2 , 0 0 2 2 0 0 0 0 ⟶ 2 2 0 0 2 2 0 0 } The length-preserving system was inverted. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2 }, it remains to prove termination of the 4-rule system { 0 0 1 1 ⟶ 1 1 0 0 , 1 1 2 2 0 0 1 1 ⟶ 2 2 1 1 2 2 0 0 , 1 1 2 2 1 1 2 2 ⟶ 2 2 1 1 2 2 2 2 , 2 2 1 1 2 2 1 1 ⟶ 1 1 2 2 1 1 1 1 } The system was reversed. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2 }, it remains to prove termination of the 4-rule system { 0 0 1 1 ⟶ 1 1 0 0 , 0 0 1 1 2 2 0 0 ⟶ 1 1 2 2 0 0 2 2 , 2 2 0 0 2 2 0 0 ⟶ 2 2 2 2 0 0 2 2 , 0 0 2 2 0 0 2 2 ⟶ 0 0 0 0 2 2 0 0 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↓) ↦ 2, (2,↓) ↦ 3, (2,↑) ↦ 4 }, it remains to prove termination of the 28-rule system { 0 1 2 2 ⟶ 0 1 , 0 1 2 2 ⟶ 0 , 0 1 2 2 3 3 1 1 ⟶ 4 3 1 1 3 3 , 0 1 2 2 3 3 1 1 ⟶ 4 1 1 3 3 , 0 1 2 2 3 3 1 1 ⟶ 0 1 3 3 , 0 1 2 2 3 3 1 1 ⟶ 0 3 3 , 0 1 2 2 3 3 1 1 ⟶ 4 3 , 0 1 2 2 3 3 1 1 ⟶ 4 , 4 3 1 1 3 3 1 1 ⟶ 4 3 3 3 1 1 3 3 , 4 3 1 1 3 3 1 1 ⟶ 4 3 3 1 1 3 3 , 4 3 1 1 3 3 1 1 ⟶ 4 3 1 1 3 3 , 4 3 1 1 3 3 1 1 ⟶ 4 1 1 3 3 , 4 3 1 1 3 3 1 1 ⟶ 0 1 3 3 , 4 3 1 1 3 3 1 1 ⟶ 0 3 3 , 4 3 1 1 3 3 1 1 ⟶ 4 3 , 4 3 1 1 3 3 1 1 ⟶ 4 , 0 1 3 3 1 1 3 3 ⟶ 0 1 1 1 3 3 1 1 , 0 1 3 3 1 1 3 3 ⟶ 0 1 1 3 3 1 1 , 0 1 3 3 1 1 3 3 ⟶ 0 1 3 3 1 1 , 0 1 3 3 1 1 3 3 ⟶ 0 3 3 1 1 , 0 1 3 3 1 1 3 3 ⟶ 4 3 1 1 , 0 1 3 3 1 1 3 3 ⟶ 4 1 1 , 0 1 3 3 1 1 3 3 ⟶ 0 1 , 0 1 3 3 1 1 3 3 ⟶ 0 , 1 1 2 2 →= 2 2 1 1 , 1 1 2 2 3 3 1 1 →= 2 2 3 3 1 1 3 3 , 3 3 1 1 3 3 1 1 →= 3 3 3 3 1 1 3 3 , 1 1 3 3 1 1 3 3 →= 1 1 1 1 3 3 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 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 4 ↦ 0, 3 ↦ 1, 1 ↦ 2, 0 ↦ 3, 2 ↦ 4 }, it remains to prove termination of the 6-rule system { 0 1 2 2 1 1 2 2 ⟶ 0 1 1 1 2 2 1 1 , 3 2 1 1 2 2 1 1 ⟶ 3 2 2 2 1 1 2 2 , 2 2 4 4 →= 4 4 2 2 , 2 2 4 4 1 1 2 2 →= 4 4 1 1 2 2 1 1 , popout

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

job log

popout

actions

all output return to SRS Standard