SRS Standard pair #487088309

details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	1.32469 seconds
cpu usage	4.0139
user time	3.71293
system time	0.300969
max virtual memory	2.5652128E7
max residence set size	519472.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 60-rule system
{ 0 1 2 -> 0 2 1 1 ,
  0 3 2 -> 0 2 1 3 ,
  2 4 1 -> 4 2 1 1 ,
  0 0 3 2 -> 0 0 2 1 3 ,
  0 1 0 3 -> 0 1 1 3 0 ,
  0 1 0 5 -> 0 0 1 1 5 ,
  0 1 2 2 -> 0 2 1 1 2 ,
  0 1 2 3 -> 0 2 1 3 1 ,
  0 1 2 5 -> 2 1 1 0 5 ,
  0 1 4 1 -> 0 4 1 1 1 ,
  0 1 4 2 -> 0 0 2 1 4 ,
  0 1 4 2 -> 0 4 0 2 1 ,
  0 1 4 3 -> 4 0 1 1 3 ,
  0 1 4 5 -> 0 1 1 5 4 ,
  0 1 5 2 -> 0 2 5 1 1 ,
  0 2 0 3 -> 0 0 2 3 1 ,
  0 3 0 1 -> 0 0 1 3 1 ,
  0 3 0 2 -> 0 0 2 3 1 ,
  0 3 0 3 -> 0 0 3 1 3 ,
  0 3 2 0 -> 0 2 1 3 0 ,
  0 3 5 1 -> 0 5 3 1 1 ,
  0 4 0 1 -> 0 0 4 1 1 ,
  0 5 2 0 -> 2 1 5 0 0 ,
  2 1 2 3 -> 2 1 1 3 2 ,
  2 1 4 1 -> 4 2 1 1 1 ,
  2 2 0 3 -> 2 0 2 1 3 ,
  2 2 4 1 -> 2 4 2 1 1 ,
  2 3 1 4 -> 2 1 1 3 4 ,
  2 4 1 4 -> 4 4 2 1 1 ,
  2 4 3 1 -> 4 2 3 1 1 ,
  2 5 0 1 -> 0 2 5 1 1 ,
  2 5 0 3 -> 5 0 2 1 3 ,
  3 0 1 0 -> 3 1 0 0 0 ,
  3 0 1 4 -> 3 1 1 0 4 ,
  3 0 3 0 -> 3 1 3 0 0 ,
  3 1 0 3 -> 3 1 1 3 0 ,
  3 1 2 1 -> 1 3 2 1 1 ,
  3 1 2 1 -> 3 2 1 1 1 ,
  3 2 0 1 -> 1 3 0 2 1 ,
  3 2 0 1 -> 3 1 0 2 1 ,
  3 4 1 2 -> 3 2 1 1 4 ,
  3 5 1 4 -> 3 1 1 5 4 ,
  4 1 0 1 -> 4 0 1 1 1 ,
  4 1 2 1 -> 2 4 1 1 1 ,
  4 1 4 3 -> 4 1 1 3 4 ,
  4 2 4 1 -> 4 4 2 1 1 ,
  4 4 1 2 -> 4 2 1 1 4 ,
  4 5 0 1 -> 5 0 4 1 1 ,
  5 1 0 3 -> 5 0 1 1 3 ,
  5 1 0 3 -> 5 1 1 3 0 ,
  5 1 3 1 -> 5 3 1 1 1 ,
  5 1 4 3 -> 4 1 1 3 5 ,
  5 1 4 4 -> 4 1 1 5 4 ,
  5 1 5 3 -> 5 5 1 1 3 ,
  5 2 0 1 -> 2 0 5 1 1 ,
  5 2 0 5 -> 5 0 2 1 5 ,
  5 3 4 1 -> 5 4 3 1 1 ,
  5 4 0 1 -> 5 0 4 1 1 ,
  5 4 1 0 -> 4 1 1 5 0 ,
  5 4 1 0 -> 5 1 1 4 0 }


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

popout

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

job log

popout

actions all output return to SRS Standard