details

property	value
status	complete
benchmark	un18.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	Trafo_06

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	13.7011 seconds
cpu usage	51.7345
user time	50.1069
system time	1.6276
max virtual memory	2.5862792E7
max residence set size	4713868.0

stage attributes

key	value
starexec-result	YES

output

YES After renaming modulo { b->0, a->1 }, it remains to prove termination of the 4-rule system { 0 0 1 1 1 0 -> 0 1 1 1 0 1 0 , 0 0 -> 0 1 0 1 0 1 0 , 0 1 0 1 1 1 0 1 0 -> 0 0 1 1 0 , 0 1 1 0 -> 0 1 1 1 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 5: 0 is interpreted by / \ | 1 1 1 0 1 | | 0 1 0 0 0 | | 0 1 0 0 0 | | 0 0 0 0 0 | | 0 1 0 0 0 | \ / 1 is interpreted by / \ | 1 0 0 0 0 | | 0 1 0 0 0 | | 0 0 0 1 0 | | 2 0 0 0 1 | | 0 0 0 0 0 | \ / After renaming modulo { 0->0, 1->1 }, it remains to prove termination of the 3-rule system { 0 0 1 1 1 0 -> 0 1 1 1 0 1 0 , 0 0 -> 0 1 0 1 0 1 0 , 0 1 0 1 1 1 0 1 0 -> 0 0 1 1 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 7: 0 is interpreted by / \ | 1 0 1 0 0 0 0 | | 0 1 0 0 0 0 0 | | 0 0 1 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 1 0 0 0 0 0 | \ / 1 is interpreted by / \ | 1 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 1 0 | | 0 0 0 0 0 0 1 | | 0 0 0 0 0 0 0 | \ / After renaming modulo { 0->0, 1->1 }, it remains to prove termination of the 2-rule system { 0 0 -> 0 1 0 1 0 1 0 , 0 1 0 1 1 1 0 1 0 -> 0 0 1 1 0 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 10: 0 is interpreted by / \ | 1 0 1 1 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 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 1 1 | | 0 0 0 0 0 0 0 0 0 0 | | 0 1 0 0 0 0 0 0 0 0 | \ / 1 is interpreted by / \ | 1 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 1 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 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 | \ / After renaming modulo { 0->0, 1->1 }, it remains to prove termination of the 1-rule system { 0 0 -> 0 1 0 1 0 1 0 } popout

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

job log

popout

actions

all output return to SRS Standard