SRS Standard pair #487516650

details

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

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	2.83421707153 seconds
cpu usage	9.482078859
max memory	1.995997184E9

stage attributes

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


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

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

popout

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

job log

popout

actions all output return to SRS Standard