SRS Standard pair #487515300

details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	4.13781499863 seconds
cpu usage	14.563173255
max memory	2.829484032E9

stage attributes

key	value
output-size	141987
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, 5->3, 3->4, 4->5 }, 
it remains to prove termination of the 50-rule system
{ 0 0 1 0 -> 0 2 2 3 0 3 0 4 2 0 ,
  2 0 1 4 -> 2 0 2 2 1 2 4 2 3 5 ,
  2 4 4 3 -> 2 4 2 2 3 5 2 4 5 4 ,
  0 1 0 0 4 -> 0 2 3 0 3 0 2 4 3 3 ,
  0 4 1 1 4 -> 0 3 1 3 4 2 0 2 1 0 ,
  1 0 1 1 5 -> 5 3 0 0 2 4 0 0 3 5 ,
  1 2 0 2 0 -> 1 0 2 3 0 2 1 3 4 2 ,
  1 4 3 1 4 -> 2 1 2 4 2 1 3 5 5 4 ,
  2 0 1 4 4 -> 2 3 0 4 0 0 0 3 1 3 ,
  2 2 1 1 0 -> 0 2 3 2 0 2 2 3 5 0 ,
  4 1 0 3 1 -> 5 2 4 0 0 3 4 4 2 5 ,
  4 4 0 4 4 -> 1 3 3 3 0 2 4 0 5 0 ,
  4 5 1 1 0 -> 1 3 1 3 4 5 1 3 3 4 ,
  5 5 0 2 0 -> 5 5 0 2 2 4 2 5 2 3 ,
  0 1 4 5 3 4 -> 0 3 4 0 0 0 2 4 2 3 ,
  1 0 1 4 1 1 -> 1 1 2 3 1 2 2 4 2 2 ,
  1 0 4 2 1 1 -> 1 0 3 3 5 2 4 2 5 0 ,
  1 1 5 3 3 3 -> 4 5 1 3 4 0 1 3 0 3 ,
  1 5 1 1 1 0 -> 1 1 2 4 2 3 5 5 2 1 ,
  2 1 2 0 4 3 -> 0 0 4 0 3 2 5 2 5 2 ,
  2 4 4 0 4 5 -> 3 2 5 1 2 4 2 0 5 5 ,
  2 3 5 1 5 4 -> 2 3 0 5 2 5 0 4 1 4 ,
  4 1 4 1 0 2 -> 1 4 1 3 2 3 0 0 2 2 ,
  4 4 0 1 4 2 -> 1 3 5 3 2 4 5 2 4 0 ,
  4 5 4 1 4 1 -> 4 0 5 3 1 2 4 0 4 3 ,
  4 5 5 0 0 1 -> 1 2 5 2 4 2 0 5 4 1 ,
  5 2 0 2 4 1 -> 5 0 3 4 2 3 0 2 4 0 ,
  3 2 0 1 4 1 -> 5 2 2 4 2 4 3 3 3 1 ,
  0 1 1 4 5 5 4 -> 0 3 0 2 5 3 1 3 5 4 ,
  0 2 1 4 1 5 3 -> 0 2 1 1 3 2 3 0 2 3 ,
  0 4 1 0 1 0 5 -> 0 3 4 3 0 3 4 0 5 3 ,
  1 0 1 0 0 1 0 -> 1 3 0 4 0 3 2 4 5 3 ,
  1 1 3 3 3 1 4 -> 5 2 1 1 2 4 2 1 3 3 ,
  1 4 1 0 0 4 4 -> 1 1 1 1 2 4 0 5 3 0 ,
  1 4 4 1 4 3 3 -> 4 5 5 3 5 4 2 2 2 3 ,
  1 4 4 4 3 1 0 -> 1 4 1 3 3 3 0 2 0 3 ,
  2 0 0 4 4 2 0 -> 0 4 0 0 3 4 1 2 4 0 ,
  2 2 4 4 1 0 1 -> 2 4 2 5 5 2 5 0 1 1 ,
  2 5 4 4 5 1 4 -> 2 4 2 5 2 4 5 4 2 3 ,
  4 1 0 3 3 5 4 -> 4 2 3 0 5 0 5 2 2 1 ,
  4 1 1 4 5 2 0 -> 1 3 0 1 3 4 4 3 0 3 ,
  4 1 3 1 4 5 4 -> 4 1 3 4 1 1 3 4 0 5 ,
  4 4 1 0 1 1 2 -> 1 1 5 3 5 3 2 2 5 3 ,
  4 4 3 3 3 1 1 -> 1 5 4 4 2 3 2 3 0 0 ,
  5 0 1 1 0 4 4 -> 3 4 1 4 4 2 4 0 2 2 ,
  5 1 2 0 0 5 1 -> 1 0 5 4 2 2 4 2 3 3 ,
  5 2 1 0 4 3 4 -> 5 0 2 3 2 3 0 3 0 4 ,
  5 4 4 4 4 2 1 -> 5 5 3 1 3 0 0 2 4 3 ,
  3 1 1 1 3 2 0 -> 2 1 2 1 5 3 1 3 2 0 ,
  3 3 5 2 0 4 4 -> 5 0 3 4 0 4 0 5 2 3 }


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

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

popout

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

job log

popout

actions all output return to SRS Standard