details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	110.909 seconds
cpu usage	389.658
user time	383.408
system time	6.25007
max virtual memory	2.5983952E7
max residence set size	2.1701044E7

stage attributes

key	value
starexec-result	YES

output

YES After renaming modulo { b->0, a->1 }, it remains to prove termination of the 1-rule system { 0 1 1 0 0 1 1 0 -> 1 1 0 0 1 1 0 1 1 0 1 1 0 0 } Applying the dependency pairs transformation. After renaming modulo { (0,true)->0, (1,false)->1, (0,false)->2 }, it remains to prove termination of the 7-rule system { 0 1 1 2 2 1 1 2 -> 0 2 1 1 2 1 1 2 1 1 2 2 , 0 1 1 2 2 1 1 2 -> 0 1 1 2 1 1 2 1 1 2 2 , 0 1 1 2 2 1 1 2 -> 0 1 1 2 1 1 2 2 , 0 1 1 2 2 1 1 2 -> 0 1 1 2 2 , 0 1 1 2 2 1 1 2 -> 0 2 , 0 1 1 2 2 1 1 2 -> 0 , 2 1 1 2 2 1 1 2 ->= 1 1 2 2 1 1 2 1 1 2 1 1 2 2 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 16: 0 is interpreted by / \ | 1 0 1 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 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 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 is interpreted by / \ | 1 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 1 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 1 0 0 0 0 0 0 0 0 | | 0 0 1 0 0 0 1 0 1 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 1 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 1 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 | \ / 2 is interpreted by / \ | 1 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 5 0 0 0 0 0 0 0 0 0 0 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 1 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 1 0 0 0 0 1 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 1 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 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 | \ / After renaming modulo { 2->0, 1->1 }, it remains to prove termination of the 1-rule system { 0 1 1 0 0 1 1 0 ->= 1 1 0 0 1 1 0 1 1 0 1 1 0 0 } The system is trivially terminating. popout

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

job log

popout

actions

all output return to SRS Standard