SRS Standard pair #516972563

details
property	value
status	complete
benchmark	88172.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	ICFP_2010
run statistics
property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	2.33497786522 seconds
cpu usage	6.833730071
max memory	1.553043456E9
stage attributes
key	value
output-size	64029
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 },
it remains to prove termination of the 28-rule system
{ 0 0 0 0 0 1 1 2 0 0 3 1 3 ⟶ 2 3 3 1 1 2 3 1 2 1 1 2 2 1 0 2 3 ,
  0 0 0 3 1 2 2 3 2 3 1 0 1 ⟶ 3 2 1 3 0 1 3 1 1 2 1 3 3 3 3 1 3 ,
  0 0 3 0 1 1 2 1 0 1 3 3 3 ⟶ 1 3 3 1 0 2 1 1 2 2 3 2 1 2 1 1 3 ,
  0 0 3 2 1 3 2 2 3 2 0 0 0 ⟶ 1 2 1 3 2 3 2 2 3 3 1 0 0 2 1 3 3 ,
  0 3 0 1 3 1 3 2 2 1 2 2 0 ⟶ 2 3 3 0 3 3 3 1 3 2 0 2 2 1 3 1 2 ,
  0 3 2 2 0 0 3 2 3 1 1 2 1 ⟶ 2 0 3 3 1 2 0 3 1 2 1 2 1 1 0 3 1 ,
  0 3 3 3 0 1 2 3 1 1 0 0 3 ⟶ 0 2 2 0 1 2 1 2 1 3 1 3 0 3 3 0 3 ,
  1 0 1 3 1 1 1 1 3 2 0 3 2 ⟶ 3 3 3 1 3 3 0 1 0 1 2 1 2 1 1 0 3 ,
  1 0 3 2 3 3 0 0 1 2 1 0 1 ⟶ 2 1 1 1 1 3 2 2 2 1 3 3 1 3 2 2 1 ,
  1 1 0 0 0 2 3 0 1 2 0 1 3 ⟶ 1 2 2 2 1 3 3 2 1 1 2 1 0 2 0 2 3 ,
  1 1 2 1 0 2 2 0 3 0 0 0 0 ⟶ 2 2 1 3 3 3 1 2 0 1 0 2 3 1 1 0 3 ,
  1 3 2 3 1 1 2 0 1 2 3 1 0 ⟶ 1 3 2 2 0 2 3 3 0 1 2 1 2 2 1 3 1 ,
  2 0 3 3 3 2 2 3 2 0 0 3 3 ⟶ 3 3 2 2 0 1 1 2 1 1 2 1 2 2 1 3 3 ,
  2 1 2 0 2 1 0 1 1 0 1 2 0 ⟶ 0 0 1 1 3 3 1 1 0 0 3 3 3 3 3 3 2 ,
  2 2 3 1 3 2 2 0 2 2 2 2 0 ⟶ 2 1 3 0 1 3 2 2 1 0 0 2 1 1 3 0 0 ,
  2 3 0 3 0 2 1 2 0 3 2 0 1 ⟶ 2 1 3 3 0 2 2 1 3 2 0 2 2 2 1 2 1 ,
  2 3 1 0 1 0 0 1 1 0 1 2 1 ⟶ 1 3 1 3 3 3 3 2 2 1 3 1 2 1 1 0 3 ,
  2 3 3 1 2 2 3 0 2 2 0 0 1 ⟶ 2 3 1 2 2 1 1 3 1 3 3 3 3 0 3 0 0 ,
  2 3 3 1 2 2 3 2 3 1 1 0 1 ⟶ 2 2 1 0 2 1 1 1 2 2 1 1 3 3 2 1 3 ,
  3 0 3 0 2 3 2 3 3 3 1 2 1 ⟶ 2 1 2 1 3 2 1 3 2 1 2 1 3 1 3 3 1 ,
  3 0 3 0 2 3 3 2 3 2 2 2 1 ⟶ 2 2 2 1 3 3 3 2 1 1 2 1 1 1 1 3 1 ,
  3 0 3 1 3 2 0 0 1 2 1 0 0 ⟶ 3 1 3 0 3 3 2 2 1 1 2 2 2 1 1 0 2 ,
  3 1 2 3 1 1 3 1 1 3 0 1 1 ⟶ 3 3 2 1 3 1 2 3 3 3 2 1 1 2 1 0 1 ,
  3 2 2 1 0 2 0 3 3 3 3 2 1 ⟶ 3 3 3 2 3 1 1 3 3 2 1 2 1 2 1 3 1 ,
  3 2 3 0 1 1 3 0 0 0 0 2 1 ⟶ 3 3 2 1 1 2 3 2 1 2 0 3 1 3 2 2 1 ,
  3 2 3 2 3 2 3 0 3 2 0 1 1 ⟶ 2 2 1 1 2 1 3 3 2 0 0 0 0 0 1 3 3 ,
  3 3 1 3 1 2 3 2 0 2 2 0 0 ⟶ 2 1 2 1 3 0 2 2 0 2 2 1 1 3 3 3 3 ,
  3 3 2 1 3 1 2 0 0 3 2 3 3 ⟶ 3 2 1 3 2 2 1 3 3 3 1 0 2 1 3 3 3 }

The system was reversed.

After renaming modulo the bijection { 3 ↦ 0, 1 ↦ 1, 0 ↦ 2, 2 ↦ 3 },
it remains to prove termination of the 28-rule system
{ 0 1 0 2 2 3 1 1 2 2 2 2 2 ⟶ 0 3 2 1 3 3 1 1 3 1 0 3 1 1 0 0 3 ,
  1 2 1 0 3 0 3 3 1 0 2 2 2 ⟶ 0 1 0 0 0 0 1 3 1 1 0 1 2 0 1 3 0 ,
  0 0 0 1 2 1 3 1 1 2 0 2 2 ⟶ 0 1 1 3 1 3 0 3 3 1 1 3 2 1 0 0 1 ,
  2 2 2 3 0 3 3 0 1 3 0 2 2 ⟶ 0 0 1 3 2 2 1 0 0 3 3 0 3 0 1 3 1 ,
  2 3 3 1 3 3 0 1 0 1 2 0 2 ⟶ 3 1 0 1 3 3 2 3 0 1 0 0 0 2 0 0 3 ,
  1 3 1 1 0 3 0 2 2 3 3 0 2 ⟶ 1 0 2 1 1 3 1 3 1 0 2 3 1 0 0 2 3 ,
  0 2 2 1 1 0 3 1 2 0 0 0 2 ⟶ 0 2 0 0 2 0 1 0 1 3 1 3 1 2 3 3 2 ,
  3 0 2 3 0 1 1 1 1 0 1 2 1 ⟶ 0 2 1 1 3 1 3 1 2 1 2 0 0 1 0 0 0 ,
  1 2 1 3 1 2 2 0 0 3 0 2 1 ⟶ 1 3 3 0 1 0 0 1 3 3 3 0 1 1 1 1 3 ,
  0 1 2 3 1 2 0 3 2 2 2 1 1 ⟶ 0 3 2 3 2 1 3 1 1 3 0 0 1 3 3 3 1 ,
  2 2 2 2 0 2 3 3 2 1 3 1 1 ⟶ 0 2 1 1 0 3 2 1 2 3 1 0 0 0 1 3 3 ,
  2 1 0 3 1 2 3 1 1 0 3 0 1 ⟶ 1 0 1 3 3 1 3 1 2 0 0 3 2 3 3 0 1 ,
  0 0 2 2 3 0 3 3 0 0 0 2 3 ⟶ 0 0 1 3 3 1 3 1 1 3 1 1 2 3 3 0 0 ,
  2 3 1 2 1 1 2 1 3 2 3 1 3 ⟶ 3 0 0 0 0 0 0 2 2 1 1 0 0 1 1 2 2 ,
  2 3 3 3 3 2 3 3 0 1 0 3 3 ⟶ 2 2 0 1 1 3 2 2 1 3 3 0 1 2 0 1 3 ,
  1 2 3 0 2 3 1 3 2 0 2 0 3 ⟶ 1 3 1 3 3 3 2 3 0 1 3 3 2 0 0 1 3 ,
  1 3 1 2 1 1 2 2 1 2 1 0 3 ⟶ 0 2 1 1 3 1 0 1 3 3 0 0 0 0 1 0 1 ,
  1 2 2 3 3 2 0 3 3 1 0 0 3 ⟶ 2 2 0 2 0 0 0 0 1 0 1 1 3 3 1 0 3 ,
  1 2 1 1 0 3 0 3 3 1 0 0 3 ⟶ 0 1 3 0 0 1 1 3 3 1 1 1 3 2 1 3 3 ,
  1 3 1 0 0 0 3 0 3 2 0 2 0 ⟶ 1 0 0 1 0 1 3 1 3 0 1 3 0 1 3 1 3 ,
  1 3 3 3 0 3 0 0 3 2 0 2 0 ⟶ 1 0 1 1 1 1 3 1 1 3 0 0 0 1 3 3 3 ,
  2 2 1 3 1 2 2 3 0 1 0 2 0 ⟶ 3 2 1 1 3 3 3 1 1 3 3 0 0 2 0 1 0 ,
  1 1 2 0 1 1 0 1 1 0 3 1 0 ⟶ 1 2 1 3 1 1 3 0 0 0 3 1 0 1 3 0 0 ,
  1 3 0 0 0 0 2 3 2 1 3 3 0 ⟶ 1 0 1 3 1 3 1 3 0 0 1 1 0 3 0 0 0 ,
  1 3 2 2 2 2 0 1 1 2 0 3 0 ⟶ 1 3 3 0 1 0 2 3 1 3 0 3 1 1 3 0 0 ,
  1 1 2 3 0 2 0 3 0 3 0 3 0 ⟶ 0 0 1 2 2 2 2 2 3 0 0 1 3 1 1 3 3 ,
  2 2 3 3 2 3 0 3 1 0 1 0 0 ⟶ 0 0 0 0 1 1 3 3 2 3 3 2 0 1 3 1 3 ,
  0 0 3 0 2 2 3 1 0 1 3 0 0 ⟶ 0 0 0 1 3 2 1 0 0 0 1 3 3 0 1 3 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,2) ↦ 4, (2,3) ↦ 5, (3,1) ↦ 6, (1,1) ↦ 7, (1,2) ↦ 8, (2,0) ↦ 9, (0,3) ↦ 10, (3,2) ↦ 11, (2,1) ↦ 12, (1,3) ↦ 13, (3,3) ↦ 14, (3,0) ↦ 15, (2,5) ↦ 16, (3,5) ↦ 17, (4,0) ↦ 18, (0,5) ↦ 19, (4,1) ↦ 20, (1,5) ↦ 21, (4,2) ↦ 22, (4,3) ↦ 23 },
it remains to prove termination of the 700-rule system
{ 0 1 2 3 4 5 6 7 8 4 4 4 4 9 ⟶ 0 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 15 ,
  0 1 2 3 4 5 6 7 8 4 4 4 4 12 ⟶ 0 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 6 ,
  0 1 2 3 4 5 6 7 8 4 4 4 4 4 ⟶ 0 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 11 ,
  0 1 2 3 4 5 6 7 8 4 4 4 4 5 ⟶ 0 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 14 ,
  0 1 2 3 4 5 6 7 8 4 4 4 4 16 ⟶ 0 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 17 ,
  2 1 2 3 4 5 6 7 8 4 4 4 4 9 ⟶ 2 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 15 ,
  2 1 2 3 4 5 6 7 8 4 4 4 4 12 ⟶ 2 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 6 ,
  2 1 2 3 4 5 6 7 8 4 4 4 4 4 ⟶ 2 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 11 ,
  2 1 2 3 4 5 6 7 8 4 4 4 4 5 ⟶ 2 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 14 ,
  2 1 2 3 4 5 6 7 8 4 4 4 4 16 ⟶ 2 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 17 ,
  9 1 2 3 4 5 6 7 8 4 4 4 4 9 ⟶ 9 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 15 ,
  9 1 2 3 4 5 6 7 8 4 4 4 4 12 ⟶ 9 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 6 ,
  9 1 2 3 4 5 6 7 8 4 4 4 4 4 ⟶ 9 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 11 ,
  9 1 2 3 4 5 6 7 8 4 4 4 4 5 ⟶ 9 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 14 ,
  9 1 2 3 4 5 6 7 8 4 4 4 4 16 ⟶ 9 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 17 ,
  15 1 2 3 4 5 6 7 8 4 4 4 4 9 ⟶ 15 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 15 ,
  15 1 2 3 4 5 6 7 8 4 4 4 4 12 ⟶ 15 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 6 ,
  15 1 2 3 4 5 6 7 8 4 4 4 4 4 ⟶ 15 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 11 ,
  15 1 2 3 4 5 6 7 8 4 4 4 4 5 ⟶ 15 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 14 ,
  15 1 2 3 4 5 6 7 8 4 4 4 4 16 ⟶ 15 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 17 ,
  18 1 2 3 4 5 6 7 8 4 4 4 4 9 ⟶ 18 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 15 ,
  18 1 2 3 4 5 6 7 8 4 4 4 4 12 ⟶ 18 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 6 ,
  18 1 2 3 4 5 6 7 8 4 4 4 4 4 ⟶ 18 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 11 ,
  18 1 2 3 4 5 6 7 8 4 4 4 4 5 ⟶ 18 10 11 12 13 14 6 7 13 6 2 10 6 7 2 0 10 14 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to SRS Standard