SRS Standard pair #516971411

details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	3.26971197128 seconds
cpu usage	11.207139133
max memory	2.763010048E9

stage attributes

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

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

popout

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

job log

popout

actions all output return to SRS Standard