details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.999078989029 seconds
cpu usage	2.410965938
max memory	6.69499392E8

stage attributes

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

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

job log

popout

actions

all output return to SRS Standard