SRS Standard pair #487514904

details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	3.31777906418 seconds
cpu usage	11.260533195
max memory	2.244595712E9

stage attributes

key	value
output-size	97396
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 49-rule system
{ 0 0 1 -> 0 0 2 1 2 ,
  0 0 1 -> 0 0 3 1 4 ,
  0 1 0 -> 0 0 1 2 4 ,
  0 1 0 -> 2 1 2 0 0 ,
  0 1 0 -> 0 0 1 2 2 4 ,
  0 1 0 -> 0 0 2 4 1 4 ,
  0 4 0 -> 3 4 3 2 0 0 ,
  0 0 1 0 -> 0 0 0 1 4 ,
  0 0 4 1 -> 0 0 2 1 4 ,
  0 0 4 1 -> 0 0 2 1 4 3 ,
  0 1 0 4 -> 0 0 3 4 1 2 ,
  0 1 3 0 -> 0 0 3 1 4 ,
  0 1 3 0 -> 0 3 0 1 2 ,
  0 1 3 0 -> 0 0 1 3 2 5 ,
  0 1 4 0 -> 0 2 0 3 1 4 ,
  0 1 5 1 -> 2 1 1 4 5 0 ,
  0 1 5 4 -> 1 2 4 2 5 0 ,
  0 1 5 4 -> 4 1 0 3 2 5 ,
  0 1 5 4 -> 5 0 2 4 1 4 ,
  0 3 0 1 -> 0 0 3 1 2 2 ,
  0 3 1 0 -> 0 0 3 1 4 ,
  0 4 0 1 -> 0 0 2 1 4 ,
  0 4 5 1 -> 1 2 4 2 5 0 ,
  0 4 5 1 -> 3 1 4 5 0 2 ,
  0 4 5 1 -> 3 2 5 1 4 0 ,
  0 4 5 1 -> 5 3 0 5 1 4 ,
  0 4 5 1 -> 5 5 0 5 1 4 ,
  0 4 5 4 -> 5 2 4 4 0 4 ,
  0 5 1 0 -> 0 0 5 1 2 ,
  3 5 0 1 -> 3 0 2 1 2 5 ,
  3 5 1 0 -> 0 5 1 3 2 ,
  3 5 1 0 -> 2 1 2 0 5 3 ,
  3 5 1 0 -> 3 1 2 2 0 5 ,
  3 5 1 0 -> 5 1 3 2 0 2 ,
  0 1 3 3 0 -> 3 3 2 0 0 1 ,
  0 1 3 5 1 -> 1 1 3 4 5 0 ,
  0 1 3 5 1 -> 1 1 5 0 3 3 ,
  0 1 5 2 0 -> 5 0 3 1 0 2 ,
  0 1 5 4 1 -> 5 3 4 1 0 1 ,
  0 1 5 4 4 -> 4 5 2 1 4 0 ,
  0 1 5 4 4 -> 5 0 4 3 4 1 ,
  0 3 1 0 4 -> 0 0 3 1 2 4 ,
  0 4 3 3 0 -> 0 2 3 4 0 3 ,
  0 4 5 2 0 -> 0 2 2 5 0 4 ,
  0 5 1 5 1 -> 5 5 3 0 1 1 ,
  3 0 1 5 4 -> 0 5 3 4 1 2 ,
  3 5 0 1 0 -> 5 1 2 0 0 3 ,
  3 5 4 0 0 -> 5 0 3 0 4 4 ,
  3 5 5 0 1 -> 5 5 0 3 1 2 }


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

popout

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

job log

popout

actions all output return to SRS Standard