details

property	value
status	complete
benchmark	04.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n187.star.cs.uiowa.edu
space	Bouchare_06

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	1.35547804832 seconds
cpu usage	1.247450777
max memory	4.03668992E8

stage attributes

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

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

job log

popout

actions

all output return to SRS Standard