details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	1.48493003845 seconds
cpu usage	4.190306257
max memory	8.74934272E8

stage attributes

key	value
output-size	6575
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 5-rule system { 0 ⟶ , 0 0 ⟶ 1 2 , 1 ⟶ , 2 ⟶ , 2 1 ⟶ 0 1 2 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↑) ↦ 2, (2,↓) ↦ 3, (2,↑) ↦ 4, (1,↓) ↦ 5 }, it remains to prove termination of the 10-rule system { 0 1 ⟶ 2 3 , 0 1 ⟶ 4 , 4 5 ⟶ 0 5 3 , 4 5 ⟶ 2 3 , 4 5 ⟶ 4 , 1 →= , 1 1 →= 5 3 , 5 →= , 3 →= , 3 5 →= 1 5 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 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 4 ↦ 2, 5 ↦ 3, 3 ↦ 4 }, it remains to prove termination of the 8-rule system { 0 1 ⟶ 2 , 2 3 ⟶ 0 3 4 , 2 3 ⟶ 2 , 1 →= , 1 1 →= 3 4 , 3 →= , 4 →= , 4 3 →= 1 3 4 } 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, (2,3) ↦ 6, (1,4) ↦ 7, (2,4) ↦ 8, (1,6) ↦ 9, (2,6) ↦ 10, (3,1) ↦ 11, (0,3) ↦ 12, (3,4) ↦ 13, (4,1) ↦ 14, (3,3) ↦ 15, (4,3) ↦ 16, (4,4) ↦ 17, (3,6) ↦ 18, (4,6) ↦ 19, (0,4) ↦ 20, (0,6) ↦ 21, (5,1) ↦ 22, (5,3) ↦ 23, (5,4) ↦ 24, (5,6) ↦ 25 }, it remains to prove termination of the 132-rule system { 0 1 2 ⟶ 3 4 , 0 1 5 ⟶ 3 6 , 0 1 7 ⟶ 3 8 , 0 1 9 ⟶ 3 10 , 3 6 11 ⟶ 0 12 13 14 , 3 6 15 ⟶ 0 12 13 16 , 3 6 13 ⟶ 0 12 13 17 , 3 6 18 ⟶ 0 12 13 19 , 3 6 11 ⟶ 3 4 , 3 6 15 ⟶ 3 6 , 3 6 13 ⟶ 3 8 , 3 6 18 ⟶ 3 10 , 1 2 →= 1 , 1 5 →= 12 , 1 7 →= 20 , 1 9 →= 21 , 2 2 →= 2 , 2 5 →= 5 , 2 7 →= 7 , 2 9 →= 9 , 4 2 →= 4 , popout

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

job log

popout

actions

all output return to SRS Standard