SRS Standard pair #487517256

details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	3.91025900841 seconds
cpu usage	13.496255936
max memory	3.032162304E9

stage attributes

key	value
output-size	476518
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 25-rule system
{ 0 1 1 2 3 -> 0 1 3 3 4 ,
  1 4 2 1 4 -> 1 1 1 0 ,
  1 4 5 1 4 -> 5 5 5 2 ,
  2 0 5 2 5 -> 2 2 3 2 1 ,
  0 1 0 5 0 4 -> 0 1 5 5 1 ,
  1 0 5 5 1 2 4 -> 2 5 4 5 1 1 4 ,
  4 0 2 5 4 3 5 -> 1 1 3 5 1 5 ,
  0 4 0 0 3 1 4 1 2 -> 2 5 3 2 2 1 2 2 ,
  5 4 5 4 2 5 0 1 5 4 -> 0 0 1 2 1 2 3 2 2 ,
  1 2 3 2 1 4 5 2 5 4 5 -> 2 1 2 4 2 2 3 0 2 1 ,
  4 2 0 4 2 2 5 0 5 3 5 -> 4 5 2 5 1 2 4 5 4 3 3 5 ,
  2 4 0 0 0 3 3 3 3 0 0 4 -> 2 0 0 2 0 4 4 3 1 0 2 ,
  3 0 3 1 2 0 1 2 2 4 0 4 -> 0 4 1 4 3 2 0 2 5 4 3 3 ,
  4 0 2 5 2 1 1 2 0 1 2 1 -> 0 2 0 0 0 1 0 1 5 2 1 ,
  4 3 4 5 2 4 4 5 4 3 4 3 -> 2 5 3 0 2 5 2 4 4 1 3 ,
  5 5 4 1 1 1 3 2 2 5 1 2 3 5 4 -> 5 5 0 3 1 2 0 2 0 2 0 4 1 2 ,
  4 2 5 1 1 3 1 3 2 5 5 4 3 5 5 4 -> 4 2 2 5 1 0 2 5 1 0 3 0 3 5 3 ,
  1 5 5 5 3 2 0 1 3 4 0 2 5 0 0 3 4 3 -> 5 4 3 1 4 2 4 5 4 5 0 3 1 0 2 2 1 3 ,
  3 0 3 4 3 3 5 1 0 4 5 0 0 0 2 2 1 4 -> 0 1 5 5 0 1 5 0 5 0 0 4 0 4 3 4 ,
  5 4 4 5 3 5 2 2 3 4 0 2 0 3 2 5 4 3 -> 5 4 0 5 1 1 1 1 3 2 0 0 3 5 0 1 3 ,
  1 5 4 3 4 4 3 3 4 5 4 1 5 5 0 1 4 0 2 -> 0 4 3 3 2 2 0 5 1 0 4 4 3 2 3 5 4 2 ,
  3 2 0 3 1 4 3 1 0 5 5 1 3 4 2 1 5 4 3 -> 3 0 3 1 1 3 0 4 1 1 2 1 5 2 0 0 4 2 3 ,
  1 1 1 3 3 0 0 1 2 2 5 1 4 4 4 5 4 3 4 1 -> 3 4 0 2 1 0 4 1 0 3 1 4 0 3 4 2 0 5 ,
  4 1 1 5 1 4 3 3 0 3 0 5 4 1 0 4 2 1 4 1 -> 4 3 4 5 3 1 1 4 1 3 0 2 0 2 5 1 1 3 1 ,
  5 4 2 4 0 4 1 4 4 2 0 1 3 4 1 3 5 4 4 4 -> 5 4 4 2 2 1 4 4 5 1 4 5 4 5 2 2 0 3 }


The system was reversed.

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


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

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

popout

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

job log

popout

actions all output return to SRS Standard