SRS Standard pair #516972647

details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	6.86568021774 seconds
cpu usage	23.550900678
max memory	4.235431936E9

stage attributes

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

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

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

popout

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

job log

popout

actions all output return to SRS Standard