details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	1.00226402283 seconds
cpu usage	2.475583424
max memory	6.65997312E8

stage attributes

key	value
output-size	2286
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 { a->0, b->1 }, it remains to prove termination of the 1-rule system { 0 0 1 1 1 0 0 0 0 -> 0 0 0 0 0 0 1 1 1 0 0 1 1 1 } The system was reversed. After renaming modulo { 0->0, 1->1 }, it remains to prove termination of the 1-rule system { 0 0 0 0 1 1 1 0 0 -> 1 1 1 0 0 1 1 1 0 0 0 0 0 0 } Applying the dependency pairs transformation. After renaming modulo { (0,true)->0, (0,false)->1, (1,false)->2 }, it remains to prove termination of the 9-rule system { 0 1 1 1 2 2 2 1 1 -> 0 1 2 2 2 1 1 1 1 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 2 2 2 1 1 1 1 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 1 1 1 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 1 1 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 1 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 1 1 , 0 1 1 1 2 2 2 1 1 -> 0 1 , 0 1 1 1 2 2 2 1 1 -> 0 , 1 1 1 1 2 2 2 1 1 ->= 2 2 2 1 1 2 2 2 1 1 1 1 1 1 } 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 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 | \ / 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 2 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 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 1 | | 0 1 1 0 1 0 0 0 0 0 | \ / 2 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 0 0 0 0 0 0 0 | | 0 0 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 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 0 0 0 | \ / After renaming modulo { 1->0, 2->1 }, it remains to prove termination of the 1-rule system { 0 0 0 0 1 1 1 0 0 ->= 1 1 1 0 0 1 1 1 0 0 0 0 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