SRS Standard pair #516970493

details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	11.4403829575 seconds
cpu usage	42.940503803
max memory	4.715839488E9

stage attributes

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

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

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

popout

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

job log

popout

actions all output return to SRS Standard