SRS Relative pair #487082368

details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	2.47221 seconds
cpu usage	8.34313
user time	7.42779
system time	0.915342
max virtual memory	2.5416776E7
max residence set size	1005132.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 0 -> 2 3 3 2 2 3 2 4 2 4 ,
  0 0 0 4 0 -> 3 4 4 4 1 2 2 0 3 4 ,
  0 4 4 1 1 -> 0 4 2 3 2 2 2 2 2 2 ,
  0 5 4 1 2 -> 3 2 1 3 3 4 2 3 2 1 ,
  1 0 0 3 0 -> 1 1 2 3 2 3 2 4 3 0 ,
  0 0 0 0 4 5 -> 0 2 3 2 4 1 5 2 3 5 ,
  0 0 0 2 0 4 -> 3 2 2 1 2 4 1 1 0 4 ,
  0 0 4 5 3 0 -> 1 2 2 3 5 2 2 1 1 4 ,
  0 1 5 3 1 1 -> 3 2 1 3 2 1 2 5 5 3 ,
  0 2 0 0 1 1 -> 3 4 2 3 1 2 3 2 3 3 ,
  0 5 0 0 0 2 -> 2 3 2 0 5 4 3 1 2 1 ,
  1 4 0 3 0 4 -> 3 2 2 5 3 3 2 1 4 4 ,
  3 0 0 1 3 5 -> 2 1 3 3 2 0 5 3 1 5 ,
  3 1 4 0 1 2 -> 2 3 2 2 1 0 3 1 1 2 ,
  4 0 0 1 3 1 -> 3 2 2 1 2 0 5 4 4 1 ,
  4 5 0 2 4 1 -> 2 1 4 2 3 2 2 3 4 1 ,
  5 4 3 0 1 5 -> 5 2 3 3 3 2 1 5 3 2 ,
  0 0 1 2 3 0 5 -> 3 2 1 3 2 1 4 3 5 5 ,
  0 0 5 1 5 1 3 -> 3 3 1 3 3 5 0 3 2 2 ,
  0 0 5 2 5 2 1 -> 2 3 5 3 4 2 2 1 2 0 ,
  0 0 5 4 2 0 2 -> 3 2 3 2 2 0 0 3 1 3 ,
  0 1 0 5 5 2 0 -> 3 2 2 4 3 3 3 0 2 0 ,
  0 2 0 3 0 0 2 -> 3 2 3 1 3 4 4 5 2 3 ,
  0 2 2 5 0 4 3 -> 0 4 1 1 2 2 3 2 5 3 ,
  0 2 4 0 1 5 4 -> 3 2 0 1 3 2 1 5 3 4 ,
  0 3 0 0 0 0 0 -> 2 0 5 2 3 1 0 2 4 4 ,
  0 4 0 0 0 4 3 -> 0 5 5 2 1 3 2 3 3 3 ,
  0 4 5 5 5 0 4 -> 2 3 5 1 2 3 0 2 4 4 ,
  0 5 1 1 5 0 0 -> 3 2 1 0 5 2 0 3 3 4 ,
  0 5 2 2 4 1 0 -> 2 3 3 1 2 3 2 3 0 4 ,
  0 5 3 1 4 3 1 -> 2 3 2 1 3 4 4 1 0 1 ,
  1 0 3 1 0 0 0 -> 2 4 2 2 5 3 2 4 4 4 ,
  1 1 2 4 4 0 2 -> 1 1 2 2 3 2 1 5 2 2 ,
  1 2 4 4 0 5 1 -> 1 3 3 2 2 3 5 1 0 3 ,
  1 3 0 0 3 3 5 -> 3 2 2 1 2 4 5 4 3 5 ,
  1 4 1 3 0 4 3 -> 1 3 5 1 2 3 2 2 5 1 ,
  1 4 4 0 0 0 0 -> 2 1 2 4 3 3 5 3 1 0 ,
  1 5 0 0 5 3 3 -> 1 5 4 3 2 1 1 3 2 1 ,
  4 0 0 0 4 0 2 -> 4 4 2 2 3 2 4 1 2 2 ,
  4 0 0 0 4 1 4 -> 4 4 3 2 1 1 2 1 0 0 ,
  4 0 0 4 0 0 2 -> 3 0 3 2 3 3 5 4 1 5 ,
  4 0 0 4 5 2 4 -> 3 3 5 2 2 2 3 4 4 0 ,
  4 0 3 0 2 5 1 -> 4 3 3 2 3 4 3 1 0 3 ,
  4 0 4 0 1 1 2 -> 2 2 0 3 1 4 3 2 2 2 ,
  4 0 4 1 4 0 0 -> 3 1 2 2 0 0 2 1 1 4 ,
  4 1 0 5 4 1 4 -> 2 5 1 2 1 3 2 4 3 4 ,
  4 1 2 5 4 0 0 -> 2 4 5 1 3 0 3 2 0 4 ,
  4 1 4 0 3 1 0 -> 5 3 2 0 2 2 2 5 1 4 ,
  4 3 0 5 5 0 2 -> 3 0 3 2 3 2 2 4 5 2 ,
  4 3 5 5 4 1 0 -> 3 5 1 3 4 5 2 3 3 4 ,
  5 0 0 0 1 4 0 -> 5 2 5 3 2 2 3 0 5 4 ,
  5 0 2 1 5 1 5 -> 5 3 2 3 3 3 4 3 3 2 ,
  5 0 2 5 4 4 0 -> 5 4 0 3 2 2 1 1 3 4 ,
  5 0 5 0 1 5 2 -> 5 3 2 3 2 4 3 2 0 2 ,
  5 0 5 5 5 4 5 -> 5 2 3 3 2 3 3 0 3 2 ,
  5 3 0 1 4 3 1 -> 3 2 2 1 2 1 0 0 3 1 ,
  5 3 5 0 1 0 1 -> 5 3 2 2 1 5 5 3 5 1 ,
  5 4 0 4 1 0 3 -> 5 3 2 2 4 4 3 2 4 3 ,
  1 5 5 1 3 1 ->= 3 3 2 1 2 1 4 4 3 1 ,
  4 0 2 1 3 1 1 ->= 4 0 5 5 5 3 2 3 2 2 }


Applying context closure of depth 1 in the following form: System R over Sigma
maps to { fold(xly) -> fold(xry) | l -> r in R, x,y in Sigma } over Sigma^2,
where fold(a_1...a_n) = (a_1,a_2)...(a_{n-1},a_{n})

After renaming modulo { [0, 0]->0, [0, 1]->1, [1, 0]->2, [0, 2]->3, [2, 3]->4, [3, 3]->5, [3, 2]->6, [2, 2]->7, [2, 4]->8, [4, 2]->9, [4, 0]->10, [0, 4]->11, [0, 3]->12, [3, 4]->13, [4, 4]->14, [4, 1]->15, [1, 2]->16, [2, 0]->17, [1, 1]->18, [0, 5]->19, [5, 4]->20, [2, 1]->21, [1, 3]->22, [3, 0]->23, [4, 3]->24, [4, 5]->25, [5, 0]->26, [1, 5]->27, [5, 2]->28, [3, 5]->29, [5, 3]->30, [1, 4]->31, [3, 1]->32, [2, 5]->33, [5, 5]->34, [5, 1]->35 },
it remains to prove termination of the 2160-rule system
{ 0 1 2 0 -> 3 4 5 6 7 4 6 8 9 8 10 ,
  0 0 0 11 10 0 -> 12 13 14 14 15 16 7 17 12 13 10 ,
  0 11 14 15 18 2 -> 0 11 9 4 6 7 7 7 7 7 17 ,
  0 19 20 15 16 17 -> 12 6 21 22 5 13 9 4 6 21 2 ,
  1 2 0 12 23 0 -> 1 18 16 4 6 4 6 8 24 23 0 ,
  0 0 0 0 11 25 26 -> 0 3 4 6 8 15 27 28 4 29 26 ,
  0 0 0 3 17 11 10 -> 12 6 7 21 16 8 15 18 2 11 10 ,
  0 0 11 25 30 23 0 -> 1 16 7 4 29 28 7 21 18 31 10 ,
  0 1 27 30 32 18 2 -> 12 6 21 22 6 21 16 33 34 30 23 ,
  0 3 17 0 1 18 2 -> 12 13 9 4 32 16 4 6 4 5 23 ,
  0 19 26 0 0 3 17 -> 3 4 6 17 19 20 24 32 16 21 2 ,
  1 31 10 12 23 11 10 -> 12 6 7 33 30 5 6 21 31 14 10 ,
  12 23 0 1 22 29 26 -> 3 21 22 5 6 17 19 30 32 27 26 ,
  12 32 31 10 1 16 17 -> 3 4 6 7 21 2 12 32 18 16 17 ,
  11 10 0 1 22 32 2 -> 12 6 7 21 16 17 19 20 14 15 2 ,
  11 25 26 3 8 15 2 -> 3 21 31 9 4 6 7 4 13 15 2 ,
  19 20 24 23 1 27 26 -> 19 28 4 5 5 6 21 27 30 6 17 ,
  0 0 1 16 4 23 19 26 -> 12 6 21 22 6 21 31 24 29 34 26 ,
  0 0 19 35 27 35 22 23 -> 12 5 32 22 5 29 26 12 6 7 17 ,
  0 0 19 28 33 28 21 2 -> 3 4 29 30 13 9 7 21 16 17 0 ,
  0 0 19 20 9 17 3 17 -> 12 6 4 6 7 17 0 12 32 22 23 ,
  0 1 2 19 34 28 17 0 -> 12 6 7 8 24 5 5 23 3 17 0 ,
  0 3 17 12 23 0 3 17 -> 12 6 4 32 22 13 14 25 28 4 23 ,
  0 3 7 33 26 11 24 23 -> 0 11 15 18 16 7 4 6 33 30 23 ,
  0 3 8 10 1 27 20 10 -> 12 6 17 1 22 6 21 27 30 13 10 ,
  0 12 23 0 0 0 0 0 -> 3 17 19 28 4 32 2 3 8 14 10 ,
  0 11 10 0 0 11 24 23 -> 0 19 34 28 21 22 6 4 5 5 23 ,
  0 11 25 34 34 26 11 10 -> 3 4 29 35 16 4 23 3 8 14 10 ,

popout

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

job log

popout

actions all output return to SRS Relative