details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	1.19821095467 seconds
cpu usage	3.230500333
max memory	1.079242752E9

stage attributes

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