details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.641546010971 seconds
cpu usage	1.108008274
max memory	4.61688832E8

stage attributes

key	value
output-size	1193
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 { c ↦ 0, a ↦ 1, d ↦ 2, b ↦ 3 }, it remains to prove termination of the 6-rule system { 0 0 0 1 ⟶ 2 2 , 2 3 ⟶ 0 0 , 0 ⟶ 1 1 1 1 , 2 ⟶ 3 3 3 3 , 3 2 ⟶ 0 0 , 1 0 0 0 ⟶ 2 2 } The system was reversed. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 6-rule system { 0 1 1 1 ⟶ 2 2 , 3 2 ⟶ 1 1 , 1 ⟶ 0 0 0 0 , 2 ⟶ 3 3 3 3 , 2 3 ⟶ 1 1 , 1 1 1 0 ⟶ 2 2 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 16 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 65 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 105 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 26 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { }, it remains to prove termination of the 0-rule system { } 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