details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	2.85257315636 seconds
cpu usage	9.639689265
max memory	1.985007616E9

stage attributes

key	value
output-size	75579
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, c ↦ 2 }, it remains to prove termination of the 4-rule system { 0 1 1 ⟶ 1 0 2 , 2 1 ⟶ 1 2 , 2 0 ⟶ 0 1 , 1 1 ⟶ 1 0 1 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↓) ↦ 1, (1,↑) ↦ 2, (0,↓) ↦ 3, (2,↓) ↦ 4, (2,↑) ↦ 5 }, it remains to prove termination of the 13-rule system { 0 1 1 ⟶ 2 3 4 , 0 1 1 ⟶ 0 4 , 0 1 1 ⟶ 5 , 5 1 ⟶ 2 4 , 5 1 ⟶ 5 , 5 3 ⟶ 0 1 , 5 3 ⟶ 2 , 2 1 ⟶ 2 3 1 , 2 1 ⟶ 0 1 , 3 1 1 →= 1 3 4 , 4 1 →= 1 4 , 4 3 →= 3 1 , 1 1 →= 1 3 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 2 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 2 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 3 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 2 ↦ 0, 1 ↦ 1, 3 ↦ 2, 4 ↦ 3 }, it remains to prove termination of the 5-rule system { 0 1 ⟶ 0 2 1 , 2 1 1 →= 1 2 3 , 3 1 →= 1 3 , 3 2 →= 2 1 , 1 1 →= 1 2 1 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (4,0) ↦ 0, (0,1) ↦ 1, (1,1) ↦ 2, (0,2) ↦ 3, (2,1) ↦ 4, (1,2) ↦ 5, (1,3) ↦ 6, (1,5) ↦ 7, (2,3) ↦ 8, (3,1) ↦ 9, (3,2) ↦ 10, (3,3) ↦ 11, (3,5) ↦ 12, (2,2) ↦ 13, (4,2) ↦ 14, (4,1) ↦ 15 }, it remains to prove termination of the 65-rule system { 0 1 2 ⟶ 0 3 4 2 , 0 1 5 ⟶ 0 3 4 5 , 0 1 6 ⟶ 0 3 4 6 , 0 1 7 ⟶ 0 3 4 7 , 3 4 2 2 →= 1 5 8 9 , 3 4 2 5 →= 1 5 8 10 , 3 4 2 6 →= 1 5 8 11 , 3 4 2 7 →= 1 5 8 12 , 5 4 2 2 →= 2 5 8 9 , 5 4 2 5 →= 2 5 8 10 , 5 4 2 6 →= 2 5 8 11 , 5 4 2 7 →= 2 5 8 12 , 13 4 2 2 →= 4 5 8 9 , 13 4 2 5 →= 4 5 8 10 , 13 4 2 6 →= 4 5 8 11 , 13 4 2 7 →= 4 5 8 12 , 10 4 2 2 →= 9 5 8 9 , 10 4 2 5 →= 9 5 8 10 , 10 4 2 6 →= 9 5 8 11 , 10 4 2 7 →= 9 5 8 12 , 14 4 2 2 →= 15 5 8 9 , 14 4 2 5 →= 15 5 8 10 , popout

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

job log

popout

actions

all output return to SRS Standard