details

property	value
status	complete
benchmark	aabbaaaaa-aaaaaaabbaaabb.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n054.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	4.29389 seconds
cpu usage	13.8473
user time	13.1402
system time	0.707063
max virtual memory	5.1186972E7
max residence set size	1424044.0

stage attributes

key	value
starexec-result	YES

output

YES After renaming modulo { a->0, b->1 }, it remains to prove termination of the 1-rule system { 0 0 1 1 0 0 0 0 0 -> 0 0 0 0 0 0 0 1 1 0 0 0 1 1 } Applying sparse 2-tiling [Hofbauer/Geser/Waldmann, FSCD 2019]. After renaming modulo { (0,0)->0, (0,1)->1, (1,1)->2, (1,0)->3, (2,0)->4 }, it remains to prove termination of the 6-rule system { 0 0 1 2 3 0 0 0 0 0 -> 0 0 0 0 0 0 0 1 2 3 0 0 1 2 3 , 0 0 1 2 3 0 0 0 0 1 -> 0 0 0 0 0 0 0 1 2 3 0 0 1 2 2 , 3 0 1 2 3 0 0 0 0 0 -> 3 0 0 0 0 0 0 1 2 3 0 0 1 2 3 , 3 0 1 2 3 0 0 0 0 1 -> 3 0 0 0 0 0 0 1 2 3 0 0 1 2 2 , 4 0 1 2 3 0 0 0 0 0 -> 4 0 0 0 0 0 0 1 2 3 0 0 1 2 3 , 4 0 1 2 3 0 0 0 0 1 -> 4 0 0 0 0 0 0 1 2 3 0 0 1 2 2 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 11: 0 is interpreted by / \ | 1 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | | 0 0 0 1 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 1 0 0 0 | | 0 0 0 0 0 0 0 0 1 0 0 | | 0 0 0 0 0 0 0 0 0 1 0 | | 0 0 0 0 0 0 0 0 0 0 1 | | 0 0 0 0 0 0 0 0 0 0 0 | \ / 1 is interpreted by / \ | 1 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 1 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | \ / 2 is interpreted by / \ | 1 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 1 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | \ / 3 is interpreted by / \ | 1 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 1 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | \ / 4 is interpreted by / \ | 1 0 1 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4 }, it remains to prove termination of the 5-rule system { 0 0 1 2 3 0 0 0 0 0 -> 0 0 0 0 0 0 0 1 2 3 0 0 1 2 3 , 0 0 1 2 3 0 0 0 0 1 -> 0 0 0 0 0 0 0 1 2 3 0 0 1 2 2 , 3 0 1 2 3 0 0 0 0 0 -> 3 0 0 0 0 0 0 1 2 3 0 0 1 2 3 , 3 0 1 2 3 0 0 0 0 1 -> 3 0 0 0 0 0 0 1 2 3 0 0 1 2 2 , 4 0 1 2 3 0 0 0 0 0 -> 4 0 0 0 0 0 0 1 2 3 0 0 1 2 3 } popout

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

job log

popout

actions

all output return to SRS Standard