details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	2.42121195793 seconds
cpu usage	7.870121135
max memory	1.309032448E9

stage attributes

key	value
output-size	15512
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 { 2 ↦ 0, 7 ↦ 1, 1 ↦ 2, 8 ↦ 3, 4 ↦ 4, 5 ↦ 5, 9 ↦ 6, 0 ↦ 7, 3 ↦ 8, 6 ↦ 9 }, it remains to prove termination of the 20-rule system { 0 1 ⟶ 2 3 , 0 3 2 ⟶ 3 , 0 3 ⟶ 4 , 5 6 ⟶ 7 , 4 ⟶ 5 0 8 , 5 8 ⟶ 9 7 , 0 3 ⟶ 1 , 4 1 ⟶ 2 8 , 5 0 9 ⟶ 9 0 4 , 6 1 ⟶ 1 5 , 1 0 ⟶ 4 , 1 7 ⟶ 6 8 , 9 6 ⟶ 6 , 6 5 6 ⟶ 5 1 , 4 ⟶ 6 9 9 , 6 ⟶ 9 1 , 9 0 ⟶ 1 1 , 0 4 ⟶ 7 1 , 9 9 ⟶ 8 , 7 8 ⟶ 5 8 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 3: 0 ↦ ⎛ ⎞ ⎜ 1 0 1 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 1 0 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 1 0 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 6 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 7 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 8 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ 9 ↦ ⎛ ⎞ ⎜ 1 0 0 ⎟ ⎜ 0 1 0 ⎟ ⎜ 0 0 0 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 5 ↦ 4, 6 ↦ 5, 7 ↦ 6, 4 ↦ 7, 8 ↦ 8, 9 ↦ 9 }, it remains to prove termination of the 17-rule system { 0 1 ⟶ 2 3 , 4 5 ⟶ 6 , 7 ⟶ 4 0 8 , 4 8 ⟶ 9 6 , popout

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

job log

popout

actions

all output return to SRS Standard