details

property	value
status	complete
benchmark	size-11-alpha-3-num-17.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n136.star.cs.uiowa.edu
space	Waldmann_07_size11

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	1.37547492981 seconds
cpu usage	4.003020244
max memory	7.5231232E8

stage attributes

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

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

job log

popout

actions

all output return to SRS Standard