SRS Standard pair #487087121

details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	5.69743 seconds
cpu usage	21.4047
user time	18.8773
system time	2.52745
max virtual memory	7.9633492E7
max residence set size	1340784.0

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 79-rule system
{ 0 1 1 2 -> 1 0 1 3 2 ,
  0 1 1 2 -> 4 1 0 1 2 ,
  0 1 1 2 -> 0 1 4 1 3 2 ,
  0 1 1 2 -> 0 4 1 4 1 2 ,
  0 1 1 2 -> 4 1 0 3 1 2 ,
  0 1 1 2 -> 4 1 3 1 0 2 ,
  0 1 1 5 -> 4 1 0 1 5 ,
  0 1 1 5 -> 5 4 1 0 1 ,
  0 1 1 5 -> 0 4 1 0 1 5 ,
  0 1 1 5 -> 0 5 4 1 0 1 ,
  0 1 1 5 -> 1 0 1 3 1 5 ,
  0 1 1 5 -> 1 4 4 0 1 5 ,
  0 1 1 5 -> 3 0 1 5 4 1 ,
  0 1 1 5 -> 3 4 1 0 1 5 ,
  0 1 1 5 -> 3 4 1 5 0 1 ,
  0 1 1 5 -> 3 5 4 1 0 1 ,
  0 1 1 5 -> 4 1 0 1 5 3 ,
  0 1 1 5 -> 4 1 0 1 5 4 ,
  0 1 1 5 -> 4 1 3 1 0 5 ,
  0 1 1 5 -> 4 1 4 1 0 5 ,
  0 1 1 5 -> 4 4 1 5 0 1 ,
  0 1 1 5 -> 5 4 1 3 1 0 ,
  0 1 2 0 -> 0 2 4 1 0 3 ,
  0 1 3 5 -> 0 3 5 4 1 ,
  0 1 4 5 -> 0 3 5 4 1 ,
  0 1 4 5 -> 4 4 0 1 5 3 ,
  0 2 4 5 -> 4 0 2 3 5 ,
  0 2 4 5 -> 4 4 0 2 5 ,
  0 2 4 5 -> 4 0 3 2 3 5 ,
  0 0 2 1 5 -> 0 0 2 5 4 1 ,
  0 0 2 4 5 -> 0 0 4 4 2 5 ,
  0 1 0 4 5 -> 0 4 0 0 1 5 ,
  0 1 0 5 0 -> 4 1 5 0 0 0 ,
  0 1 1 0 5 -> 1 0 4 0 1 5 ,
  0 1 1 2 0 -> 0 4 1 2 1 0 ,
  0 1 1 2 0 -> 4 1 2 1 0 0 ,
  0 1 1 3 5 -> 4 1 0 1 3 5 ,
  0 1 1 3 5 -> 5 4 1 0 3 1 ,
  0 1 1 4 2 -> 0 4 1 4 1 2 ,
  0 1 1 4 2 -> 4 1 3 1 2 0 ,
  0 1 1 4 2 -> 4 2 4 1 0 1 ,
  0 1 1 4 5 -> 0 5 4 1 3 1 ,
  0 1 1 4 5 -> 0 5 4 1 4 1 ,
  0 1 1 4 5 -> 2 4 1 0 1 5 ,
  0 1 2 0 2 -> 0 4 0 1 2 2 ,
  0 1 2 1 5 -> 0 1 4 1 2 5 ,
  0 1 4 5 0 -> 0 5 4 1 0 3 ,
  0 1 5 1 5 -> 5 4 1 0 1 5 ,
  0 2 0 1 5 -> 1 0 0 2 3 5 ,
  0 2 0 4 5 -> 0 0 2 4 1 5 ,
  0 2 0 5 0 -> 0 2 5 0 3 0 ,
  0 2 3 1 5 -> 0 0 1 2 3 5 ,
  0 2 3 1 5 -> 0 2 5 3 4 1 ,
  0 2 3 1 5 -> 0 3 5 2 4 1 ,
  0 2 3 1 5 -> 2 0 4 1 3 5 ,
  0 2 3 1 5 -> 2 0 4 1 5 3 ,
  0 2 3 1 5 -> 2 3 5 3 0 1 ,
  0 2 3 1 5 -> 2 5 3 4 1 0 ,
  0 2 3 1 5 -> 4 1 0 5 2 3 ,
  0 2 3 1 5 -> 4 1 3 0 2 5 ,
  0 2 3 1 5 -> 4 1 5 2 0 3 ,
  0 2 5 1 2 -> 0 2 3 2 1 5 ,
  0 2 5 1 5 -> 0 3 5 2 1 5 ,
  0 2 5 1 5 -> 0 4 1 5 2 5 ,
  0 2 5 1 5 -> 2 4 1 5 0 5 ,
  0 2 5 1 5 -> 4 1 0 5 2 5 ,
  0 2 5 1 5 -> 4 1 5 5 2 0 ,
  0 3 5 1 5 -> 5 0 3 5 4 1 ,
  0 4 2 0 2 -> 0 0 4 3 2 2 ,
  0 4 2 1 5 -> 0 2 5 4 4 1 ,
  0 4 2 1 5 -> 0 4 1 5 3 2 ,
  0 4 2 1 5 -> 2 4 1 0 0 5 ,
  0 4 2 1 5 -> 2 4 1 3 0 5 ,
  0 4 2 1 5 -> 2 4 1 5 4 0 ,
  0 4 2 1 5 -> 3 0 1 5 2 4 ,
  0 4 2 1 5 -> 3 0 5 2 4 1 ,
  0 4 2 1 5 -> 4 1 3 2 5 0 ,
  0 4 2 1 5 -> 4 4 0 1 5 2 ,
  0 4 5 1 5 -> 5 4 1 5 0 4 }


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

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

popout

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

job log

popout

actions all output return to SRS Standard