SRS Standard pair #487087739

details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	1.52614 seconds
cpu usage	4.98019
user time	4.47219
system time	0.507993
max virtual memory	5.1232144E7
max residence set size	740208.0

stage attributes

key	value
starexec-result	YES

output

YES

After renaming modulo { 5->0, 4->1, 0->2, 2->3, 1->4, 3->5 }, 
it remains to prove termination of the 41-rule system
{ 0 1 2 -> 2 3 3 4 4 5 2 1 5 2 ,
  1 4 1 2 -> 1 2 3 3 4 4 2 2 0 3 ,
  0 1 1 0 -> 4 4 3 5 3 2 5 4 3 2 ,
  2 5 1 2 1 -> 3 2 3 4 5 2 1 3 5 1 ,
  2 5 1 0 1 -> 4 2 4 3 1 3 5 4 3 1 ,
  4 4 0 0 1 -> 4 5 2 2 2 3 5 5 1 4 ,
  4 1 0 0 1 -> 3 2 4 2 3 5 1 3 0 4 ,
  3 0 1 0 2 -> 4 4 3 1 3 2 3 2 0 2 ,
  5 4 0 4 4 -> 5 0 2 0 5 4 3 0 0 4 ,
  1 2 2 1 0 -> 5 5 3 2 2 4 1 5 5 0 ,
  1 4 1 3 2 -> 2 1 3 4 5 4 2 5 5 2 ,
  0 1 4 1 4 -> 2 4 2 3 2 4 3 1 1 3 ,
  2 5 1 4 2 1 -> 3 1 4 1 5 5 5 2 2 1 ,
  2 5 1 0 4 5 -> 1 1 1 5 4 5 5 5 2 5 ,
  2 1 2 0 4 1 -> 2 2 5 5 4 3 2 5 3 1 ,
  4 5 3 0 1 2 -> 5 2 1 2 2 1 5 4 1 2 ,
  4 5 0 1 0 1 -> 3 5 3 2 4 3 0 3 4 0 ,
  4 1 3 4 1 2 -> 2 5 5 2 3 2 5 3 2 0 ,
  4 0 5 1 4 5 -> 4 4 5 4 4 3 2 4 3 5 ,
  4 0 1 0 2 1 -> 1 5 3 5 3 2 4 5 1 2 ,
  4 0 0 1 4 5 -> 5 0 4 5 3 4 4 1 5 5 ,
  3 5 0 1 0 4 -> 0 1 5 0 0 0 4 3 0 4 ,
  5 1 0 5 0 2 -> 5 1 5 5 3 5 0 5 5 2 ,
  0 1 0 1 1 0 -> 4 2 5 3 2 5 5 1 1 0 ,
  2 3 0 3 1 2 1 -> 1 5 2 4 3 4 2 3 2 4 ,
  4 4 0 0 1 2 0 -> 1 3 3 3 4 4 1 3 1 3 ,
  4 1 2 5 4 1 4 -> 2 1 4 5 5 5 1 3 3 2 ,
  4 1 4 2 1 2 5 -> 3 1 1 5 5 3 1 2 3 5 ,
  4 1 1 0 4 2 3 -> 3 5 2 4 1 2 4 1 3 5 ,
  4 1 1 0 1 3 1 -> 4 2 2 4 0 4 3 4 0 1 ,
  4 0 1 4 4 5 5 -> 2 0 5 3 2 4 5 5 3 5 ,
  4 0 1 1 4 1 0 -> 3 5 3 2 3 0 5 1 5 0 ,
  3 2 3 0 1 0 4 -> 2 2 0 5 2 3 4 3 1 2 ,
  3 5 0 1 1 2 0 -> 3 0 4 5 2 3 5 2 3 0 ,
  3 1 3 1 1 4 5 -> 2 5 3 3 4 2 4 4 2 5 ,
  3 0 1 1 0 1 4 -> 3 3 4 3 1 0 5 3 1 3 ,
  5 0 1 4 1 4 0 -> 5 4 0 3 0 5 3 0 3 0 ,
  1 3 1 1 1 0 1 -> 1 5 5 1 4 2 1 0 0 1 ,
  1 0 1 2 1 1 2 -> 2 5 4 5 1 2 2 0 0 0 ,
  0 1 2 5 3 5 0 -> 4 2 5 3 4 2 4 3 5 0 ,
  0 1 2 5 3 0 2 -> 3 1 5 3 1 4 4 2 0 0 }


The system was reversed.

After renaming modulo { 2->0, 1->1, 0->2, 5->3, 4->4, 3->5 }, 
it remains to prove termination of the 41-rule system
{ 0 1 2 -> 0 3 1 0 3 4 4 5 5 0 ,
  0 1 4 1 -> 5 2 0 0 4 4 5 5 0 1 ,
  2 1 1 2 -> 0 5 4 3 0 5 3 5 4 4 ,
  1 0 1 3 0 -> 1 3 5 1 0 3 4 5 0 5 ,
  1 2 1 3 0 -> 1 5 4 3 5 1 5 4 0 4 ,
  1 2 2 4 4 -> 4 1 3 3 5 0 0 0 3 4 ,
  1 2 2 1 4 -> 4 2 5 1 3 5 0 4 0 5 ,
  0 2 1 2 5 -> 0 2 0 5 0 5 1 5 4 4 ,
  4 4 2 4 3 -> 4 2 2 5 4 3 2 0 2 3 ,
  2 1 0 0 1 -> 2 3 3 1 4 0 0 5 3 3 ,
  0 5 1 4 1 -> 0 3 3 0 4 3 4 5 1 0 ,
  4 1 4 1 2 -> 5 1 1 5 4 0 5 0 4 0 ,
  1 0 4 1 3 0 -> 1 0 0 3 3 3 1 4 1 5 ,
  3 4 2 1 3 0 -> 3 0 3 3 3 4 3 1 1 1 ,
  1 4 2 0 1 0 -> 1 5 3 0 5 4 3 3 0 0 ,
  0 1 2 5 3 4 -> 0 1 4 3 1 0 0 1 0 3 ,
  1 2 1 2 3 4 -> 2 4 5 2 5 4 0 5 3 5 ,
  0 1 4 5 1 4 -> 2 0 5 3 0 5 0 3 3 0 ,
  3 4 1 3 2 4 -> 3 5 4 0 5 4 4 3 4 4 ,
  1 0 2 1 2 4 -> 0 1 3 4 0 5 3 5 3 1 ,
  3 4 1 2 2 4 -> 3 3 1 4 4 5 3 4 2 3 ,
  4 2 1 2 3 5 -> 4 2 5 4 2 2 2 3 1 2 ,
  0 2 3 2 1 3 -> 0 3 3 2 3 5 3 3 1 3 ,
  2 1 1 2 1 2 -> 2 1 1 3 3 0 5 3 0 4 ,
  1 0 1 5 2 5 0 -> 4 0 5 0 4 5 4 0 3 1 ,
  2 0 1 2 2 4 4 -> 5 1 5 1 4 4 5 5 5 1 ,
  4 1 4 3 0 1 4 -> 0 5 5 1 3 3 3 4 1 0 ,
  3 0 1 0 4 1 4 -> 3 5 0 1 5 3 3 1 1 5 ,
  5 0 4 2 1 1 4 -> 3 5 1 4 0 1 4 0 3 5 ,
  1 5 1 2 1 1 4 -> 1 2 4 5 4 2 4 0 0 4 ,
  3 3 4 4 1 2 4 -> 3 5 3 3 4 0 5 3 2 0 ,
  2 1 4 1 1 2 4 -> 2 3 1 3 2 5 0 5 3 5 ,
  4 2 1 2 5 0 5 -> 0 1 5 4 5 0 3 2 0 0 ,
  2 0 1 1 2 3 5 -> 2 5 0 3 5 0 3 4 2 5 ,
  3 4 1 1 5 1 5 -> 3 0 4 4 0 4 5 5 3 0 ,
  4 1 2 1 1 2 5 -> 5 1 5 3 2 1 5 4 5 5 ,
  2 4 1 4 1 2 3 -> 2 5 2 5 3 2 5 2 4 3 ,
  1 2 1 1 1 5 1 -> 1 2 2 1 0 4 1 3 3 1 ,
  0 1 1 0 1 2 1 -> 2 2 2 0 0 1 3 4 3 0 ,
  2 3 5 3 0 1 2 -> 2 3 5 4 0 4 5 3 0 4 ,
  0 2 5 3 0 1 2 -> 2 2 0 4 4 1 5 3 1 5 }


Applying sparse 2-tiling [Hofbauer/Geser/Waldmann, FSCD 2019].

After renaming modulo { (0,0)->0, (0,1)->1, (1,2)->2, (2,0)->3, (0,3)->4, (3,1)->5, (1,0)->6, (3,4)->7, (4,4)->8, (4,5)->9, (5,5)->10, (5,0)->11, (2,1)->12, (2,2)->13, (0,2)->14, (2,3)->15, (2,4)->16, (0,4)->17, (2,5)->18, (0,5)->19, (2,7)->20, (0,7)->21, (3,0)->22, (4,0)->23, (6,0)->24, (1,4)->25, (4,1)->26, (5,2)->27, (1,1)->28, (1,3)->29, (1,5)->30, (1,7)->31, (3,5)->32, (6,5)->33, (5,4)->34, (4,3)->35, (5,3)->36, (4,2)->37, (4,7)->38, (3,2)->39, (6,2)->40, (5,1)->41, (5,7)->42, (6,1)->43, (3,3)->44, (6,4)->45, (3,7)->46, (6,3)->47 },
it remains to prove termination of the 2009-rule system
{ 0 1 2 3 -> 0 4 5 6 4 7 8 9 10 11 0 ,
  0 1 2 12 -> 0 4 5 6 4 7 8 9 10 11 1 ,

popout

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

job log

popout

actions all output return to SRS Standard