SRS Standard pair #487516266

details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	4.00478005409 seconds
cpu usage	14.168476266
max memory	2.74294784E9

stage attributes

key	value
output-size	321539
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

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


Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019].

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

popout

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

job log

popout

actions all output return to SRS Standard