details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	1.77222895622 seconds
cpu usage	5.547589326
max memory	1.65115904E9

stage attributes

key	value
output-size	6849
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo { a->0, b->1 }, it remains to prove termination of the 1-rule system { 0 1 0 0 0 0 0 -> 0 0 0 0 0 0 1 0 0 0 0 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 0 1 0 -> 1 0 0 0 0 1 0 0 0 0 0 0 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo { (0,0)->0, (0,1)->1, (1,0)->2, (0,3)->3, (1,1)->4 }, it remains to prove termination of the 6-rule system { 0 0 0 0 0 1 2 0 -> 1 2 0 0 0 1 2 0 0 0 0 0 0 , 0 0 0 0 0 1 2 1 -> 1 2 0 0 0 1 2 0 0 0 0 0 1 , 0 0 0 0 0 1 2 3 -> 1 2 0 0 0 1 2 0 0 0 0 0 3 , 2 0 0 0 0 1 2 0 -> 4 2 0 0 0 1 2 0 0 0 0 0 0 , 2 0 0 0 0 1 2 1 -> 4 2 0 0 0 1 2 0 0 0 0 0 1 , 2 0 0 0 0 1 2 3 -> 4 2 0 0 0 1 2 0 0 0 0 0 3 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 9: 0 is interpreted by / \ | 1 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 1 0 0 0 0 | | 0 0 0 0 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 | \ / 1 is interpreted by / \ | 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 1 0 | | 0 0 0 0 0 0 0 0 0 | | 0 0 0 0 0 0 0 0 0 | \ / 2 is interpreted by / \ | 1 0 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 0 0 0 | | 0 0 0 0 0 0 0 0 0 | | 0 0 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 | \ / 3 is interpreted by / \ | 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 1 0 0 0 0 0 0 0 | \ / 4 is interpreted by / \ | 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 | \ / 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 0 0 0 1 2 0 -> 1 2 0 0 0 1 2 0 0 0 0 0 0 , 0 0 0 0 0 1 2 1 -> 1 2 0 0 0 1 2 0 0 0 0 0 1 , popout

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

job log

popout

actions

all output return to SRS Standard