details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	17.4677 seconds
cpu usage	67.7864
user time	57.058
system time	10.7284
max virtual memory	2.6390904E7
max residence set size	1.368938E7

stage attributes

key	value
starexec-result	YES

output

YES After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5 }, it remains to prove termination of the 40-rule system { 0 1 2 3 -> 3 4 5 , 1 2 0 5 5 -> 1 5 4 0 , 2 0 3 4 2 -> 3 1 2 4 , 5 5 5 5 0 -> 5 4 4 3 , 0 1 2 4 3 5 -> 2 4 5 3 0 , 0 3 0 4 2 0 -> 2 3 4 1 2 , 4 5 0 4 0 0 0 -> 4 3 4 2 5 0 , 0 1 0 2 1 4 4 2 -> 0 2 0 3 3 4 5 4 , 2 0 0 1 5 0 5 2 -> 2 0 5 2 1 1 , 3 4 1 4 3 0 3 2 -> 5 3 5 4 3 1 1 , 5 3 0 1 5 5 0 5 -> 5 0 4 2 1 3 4 , 5 5 5 3 1 3 4 4 -> 1 5 2 4 4 5 4 , 0 1 5 4 2 5 3 3 4 -> 2 0 5 4 3 0 1 0 4 , 0 3 3 1 2 2 0 4 5 -> 2 3 4 4 4 0 3 1 , 4 3 4 0 5 3 0 0 5 4 -> 3 1 1 2 1 2 0 4 2 , 4 2 5 4 5 2 1 1 0 2 1 -> 4 2 3 4 1 0 5 4 5 2 1 , 5 5 4 2 5 3 1 0 5 3 1 -> 2 2 2 2 2 0 3 5 1 2 1 , 5 5 5 0 3 5 2 4 1 2 4 -> 1 0 3 3 5 0 3 1 4 4 , 0 3 3 2 0 1 1 2 1 3 0 5 -> 2 3 0 2 5 4 1 0 1 2 4 3 , 3 3 2 5 2 5 4 5 0 5 4 2 1 -> 2 1 2 3 3 4 4 2 0 3 4 1 , 4 3 4 2 2 5 4 5 0 0 0 2 5 -> 4 4 5 1 4 5 0 1 0 5 3 , 3 4 0 4 1 2 3 5 2 1 4 4 0 3 -> 3 2 2 5 0 4 5 5 0 5 5 4 1 2 , 4 0 5 4 4 4 5 0 2 5 2 3 4 5 -> 4 1 0 4 3 4 2 3 1 3 2 3 3 , 5 3 5 4 2 4 4 5 0 5 4 1 2 2 -> 5 0 2 5 5 1 5 3 4 1 1 0 2 , 2 2 4 3 4 4 2 1 5 2 1 4 0 2 0 -> 3 5 3 3 1 2 1 3 0 4 5 3 4 0 , 0 2 0 2 5 2 2 1 4 5 0 3 1 5 0 2 -> 0 4 3 5 5 5 1 3 0 4 5 0 2 2 4 , 5 0 0 2 0 2 2 0 1 1 3 4 4 3 3 5 -> 5 4 0 3 4 4 1 0 0 3 5 1 4 5 5 5 , 5 0 2 3 2 4 4 3 4 1 0 0 0 4 4 3 -> 5 2 4 4 4 0 1 1 4 2 5 5 1 3 , 0 2 0 2 0 1 1 3 5 2 0 4 4 1 5 5 5 -> 4 1 3 4 1 1 3 1 0 4 2 2 5 3 3 , 0 4 3 0 2 1 3 3 3 0 5 1 2 3 2 5 4 0 -> 1 5 5 5 2 2 1 2 0 4 0 1 4 1 5 4 4 , 2 2 3 2 3 2 2 4 1 2 4 5 1 4 4 0 4 0 -> 5 2 2 0 4 4 5 4 2 3 2 3 1 0 5 3 3 4 , 2 4 1 1 1 2 5 4 4 2 0 0 1 4 5 5 5 0 -> 3 3 2 4 5 2 5 4 5 4 5 3 3 3 0 5 0 2 3 , 3 2 0 2 1 0 3 1 3 4 3 5 2 1 0 0 3 0 -> 5 2 4 0 1 5 2 3 3 5 4 4 5 2 3 3 3 0 , 2 5 1 2 0 4 1 2 4 3 2 0 4 3 1 3 5 2 5 -> 2 4 5 1 2 3 0 4 1 3 2 3 4 2 0 3 3 3 , 4 4 4 1 1 1 2 1 1 0 4 3 2 3 1 3 0 3 5 -> 4 1 0 2 3 3 0 1 1 4 5 3 1 1 5 3 2 2 3 5 , 3 5 3 3 0 0 4 4 4 4 0 1 1 5 2 5 0 5 0 2 -> 2 0 5 2 4 3 3 4 5 4 3 1 4 0 0 2 5 1 1 , 4 1 5 3 2 5 5 5 2 5 5 3 5 5 5 3 5 0 2 0 -> 4 1 4 0 5 2 1 3 4 3 1 1 0 4 3 3 2 0 , 0 0 4 0 0 0 0 1 0 4 4 5 3 2 2 4 0 5 3 0 5 -> 0 2 2 2 1 2 4 4 5 0 5 1 0 0 5 5 2 5 3 2 , 2 2 0 3 4 0 5 2 5 2 2 5 2 5 5 1 5 2 4 1 4 -> 0 0 5 2 4 1 4 3 4 3 2 4 4 3 4 4 1 1 4 , 2 5 5 5 0 2 3 2 4 0 0 1 5 2 3 2 3 0 1 0 5 -> 2 0 3 4 5 3 3 2 2 1 5 2 2 2 4 2 5 4 0 1 } The system was reversed. After renaming modulo { 3->0, 2->1, 1->2, 0->3, 5->4, 4->5 }, it remains to prove termination of the 40-rule system { 0 1 2 3 -> 4 5 0 , 4 4 3 1 2 -> 3 5 4 2 , 1 5 0 3 1 -> 5 1 2 0 , 3 4 4 4 4 -> 0 5 5 4 , 4 0 5 1 2 3 -> 3 0 4 5 1 , 3 1 5 3 0 3 -> 1 2 5 0 1 , 3 3 3 5 3 4 5 -> 3 4 1 5 0 5 , 1 5 5 2 1 3 2 3 -> 5 4 5 0 0 3 1 3 , 1 4 3 4 2 3 3 1 -> 2 2 1 4 3 1 , 1 0 3 0 5 2 5 0 -> 2 2 0 5 4 0 4 , 4 3 4 4 2 3 0 4 -> 5 0 2 1 5 3 4 , 5 5 0 2 0 4 4 4 -> 5 4 5 5 1 4 2 , 5 0 0 4 1 5 4 2 3 -> 5 3 2 3 0 5 4 3 1 , 4 5 3 1 1 2 0 0 3 -> 2 0 3 5 5 5 0 1 , 5 4 3 3 0 4 3 5 0 5 -> 1 5 3 1 2 1 2 2 0 , 2 1 3 2 2 1 4 5 4 1 5 -> 2 1 4 5 4 3 2 5 0 1 5 , 2 0 4 3 2 0 4 1 5 4 4 -> 2 1 2 4 0 3 1 1 1 1 1 , 5 1 2 5 1 4 0 3 4 4 4 -> 5 5 2 0 3 4 0 0 3 2 , 4 3 0 2 1 2 2 3 1 0 0 3 -> 0 5 1 2 3 2 5 4 1 3 0 1 , 2 1 5 4 3 4 5 4 1 4 1 0 0 -> 2 5 0 3 1 5 5 0 0 1 2 1 , 4 1 3 3 3 4 5 4 1 1 5 0 5 -> 0 4 3 2 3 4 5 2 4 5 5 , 0 3 5 5 2 1 4 0 1 2 5 3 5 0 -> 1 2 5 4 4 3 4 4 5 3 4 1 1 0 , 4 5 0 1 4 1 3 4 5 5 5 4 3 5 -> 0 0 1 0 2 0 1 5 0 5 3 2 5 , 1 1 2 5 4 3 4 5 5 1 5 4 0 4 -> 1 3 2 2 5 0 4 2 4 4 1 3 4 , 3 1 3 5 2 1 4 2 1 5 5 0 5 1 1 -> 3 5 0 4 5 3 0 2 1 2 0 0 4 0 , 1 3 4 2 0 3 4 5 2 1 1 4 1 3 1 3 -> 5 1 1 3 4 5 3 0 2 4 4 4 0 5 3 , 4 0 0 5 5 0 2 2 3 1 1 3 1 3 3 4 -> 4 4 4 5 2 4 0 3 3 2 5 5 0 3 5 4 , 0 5 5 3 3 3 2 5 0 5 5 1 0 1 3 4 -> 0 2 4 4 1 5 2 2 3 5 5 5 1 4 , 4 4 4 2 5 5 3 1 4 0 2 2 3 1 3 1 3 -> 0 0 4 1 1 5 3 2 0 2 2 5 0 2 5 , 3 5 4 1 0 1 2 4 3 0 0 0 2 1 3 0 5 3 -> 5 5 4 2 5 2 3 5 3 1 2 1 1 4 4 4 2 , 3 5 3 5 5 2 4 5 1 2 5 1 1 0 1 0 1 1 -> 5 0 0 4 3 2 0 1 0 1 5 4 5 5 3 1 1 4 , 3 4 4 4 5 2 3 3 1 5 5 4 1 2 2 2 5 1 -> 0 1 3 4 3 0 0 0 4 5 4 5 4 1 4 5 1 0 0 , 3 0 3 3 2 1 4 0 5 0 2 0 3 2 1 3 1 0 -> 3 0 0 0 1 4 5 5 4 0 0 1 4 2 3 5 1 4 , 4 1 4 0 2 0 5 3 1 0 5 1 2 5 3 1 2 4 1 -> 0 0 0 3 1 5 0 1 0 2 5 3 0 1 2 4 5 1 , 4 0 3 0 2 0 1 0 5 3 2 2 1 2 2 2 5 5 5 -> 4 0 1 1 0 4 2 2 0 4 5 2 2 3 0 0 1 3 2 5 , 1 3 4 3 4 1 4 2 2 3 5 5 5 5 3 3 0 0 4 0 -> 2 2 4 1 3 3 5 2 0 5 4 5 0 0 5 1 4 3 1 , 3 1 3 4 0 4 4 4 0 4 4 1 4 4 4 1 0 4 2 5 -> 3 1 0 0 5 3 2 2 0 5 0 2 1 4 3 5 2 5 , 4 3 0 4 3 5 1 1 0 4 5 5 3 2 3 3 3 3 5 3 3 -> 1 0 4 1 4 4 3 3 2 4 3 4 5 5 1 2 1 1 1 3 , 5 2 5 1 4 2 4 4 1 4 1 1 4 1 4 3 5 0 3 1 1 -> 5 2 2 5 5 0 5 5 1 0 5 0 5 2 5 1 4 3 3 , 4 3 2 3 0 1 0 1 4 2 3 3 5 1 0 1 3 4 4 4 1 -> 2 3 5 4 1 5 1 1 1 4 2 1 1 0 0 4 5 0 3 1 } Applying sparse 2-tiling [Hofbauer/Geser/Waldmann, FSCD 2019]. After renaming modulo { (0,0)->0, (0,1)->1, (1,2)->2, (2,3)->3, (3,0)->4, (0,4)->5, (4,5)->6, (5,0)->7, (3,1)->8, (3,2)->9, (0,2)->10, (3,3)->11, (0,3)->12, (3,4)->13, (3,5)->14, (0,5)->15, (3,7)->16, (0,7)->17, (1,0)->18, (1,4)->19, (2,0)->20, (2,4)->21, (4,0)->22, (4,4)->23, (5,4)->24, (6,0)->25, (6,4)->26, (4,3)->27, (4,2)->28, (2,1)->29, (2,2)->30, (2,5)->31, (2,7)->32, (1,3)->33, (5,3)->34, (6,3)->35, (1,5)->36, (5,1)->37, (1,1)->38, (1,7)->39, (4,1)->40, (5,5)->41, (6,1)->42, (6,5)->43, (4,7)->44, (5,2)->45, (5,7)->46, (6,2)->47 }, it remains to prove termination of the 1960-rule system { 0 1 2 3 4 -> 5 6 7 0 , 0 1 2 3 8 -> 5 6 7 1 , 0 1 2 3 9 -> 5 6 7 10 , 0 1 2 3 11 -> 5 6 7 12 , popout

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

job log

popout

actions

all output return to SRS Standard