SRS Standard pair #516975773

details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	14.2570688725 seconds
cpu usage	54.700256765
max memory	6.78561792E9

stage attributes

key	value
output-size	274026
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 { a ↦ 0, b ↦ 1, c ↦ 2 },
it remains to prove termination of the 5-rule system
{ 0 0 ⟶ 1 0 1 ,
  1 1 ⟶ 0 2 1 ,
  2 2 ⟶ 2 1 0 ,
  0 1 ⟶ 1 0 ,
  1 2 ⟶ 2 }

The system was reversed.

After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2 },
it remains to prove termination of the 5-rule system
{ 0 0 ⟶ 1 0 1 ,
  1 1 ⟶ 1 2 0 ,
  2 2 ⟶ 0 1 2 ,
  1 0 ⟶ 0 1 ,
  2 1 ⟶ 2 }

Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols.

After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↑) ↦ 2, (1,↓) ↦ 3, (2,↓) ↦ 4, (2,↑) ↦ 5 },
it remains to prove termination of the 16-rule system
{ 0 1 ⟶ 2 1 3 ,
  0 1 ⟶ 0 3 ,
  0 1 ⟶ 2 ,
  2 3 ⟶ 2 4 1 ,
  2 3 ⟶ 5 1 ,
  2 3 ⟶ 0 ,
  5 4 ⟶ 0 3 4 ,
  5 4 ⟶ 2 4 ,
  2 1 ⟶ 0 3 ,
  2 1 ⟶ 2 ,
  5 3 ⟶ 5 ,
  1 1 →= 3 1 3 ,
  3 3 →= 3 4 1 ,
  4 4 →= 1 3 4 ,
  3 1 →= 1 3 ,
  4 3 →= 4 }

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

After renaming modulo the bijection { (6,0) ↦ 0, (0,1) ↦ 1, (1,1) ↦ 2, (6,2) ↦ 3, (2,1) ↦ 4, (1,3) ↦ 5, (3,1) ↦ 6, (3,3) ↦ 7, (1,4) ↦ 8, (3,4) ↦ 9, (1,7) ↦ 10, (3,7) ↦ 11, (0,3) ↦ 12, (2,3) ↦ 13, (2,4) ↦ 14, (2,7) ↦ 15, (4,1) ↦ 16, (6,5) ↦ 17, (5,1) ↦ 18, (0,4) ↦ 19, (0,7) ↦ 20, (5,4) ↦ 21, (4,3) ↦ 22, (4,4) ↦ 23, (4,7) ↦ 24, (5,3) ↦ 25, (5,7) ↦ 26, (6,1) ↦ 27, (6,3) ↦ 28, (6,4) ↦ 29 },
it remains to prove termination of the 184-rule system
{ 0 1 2 ⟶ 3 4 5 6 ,
  0 1 5 ⟶ 3 4 5 7 ,
  0 1 8 ⟶ 3 4 5 9 ,
  0 1 10 ⟶ 3 4 5 11 ,
  0 1 2 ⟶ 0 12 6 ,
  0 1 5 ⟶ 0 12 7 ,
  0 1 8 ⟶ 0 12 9 ,
  0 1 10 ⟶ 0 12 11 ,
  0 1 2 ⟶ 3 4 ,
  0 1 5 ⟶ 3 13 ,
  0 1 8 ⟶ 3 14 ,
  0 1 10 ⟶ 3 15 ,
  3 13 6 ⟶ 3 14 16 2 ,
  3 13 7 ⟶ 3 14 16 5 ,
  3 13 9 ⟶ 3 14 16 8 ,
  3 13 11 ⟶ 3 14 16 10 ,
  3 13 6 ⟶ 17 18 2 ,
  3 13 7 ⟶ 17 18 5 ,
  3 13 9 ⟶ 17 18 8 ,
  3 13 11 ⟶ 17 18 10 ,
  3 13 6 ⟶ 0 1 ,
  3 13 7 ⟶ 0 12 ,
  3 13 9 ⟶ 0 19 ,
  3 13 11 ⟶ 0 20 ,
  17 21 16 ⟶ 0 12 9 16 ,
  17 21 22 ⟶ 0 12 9 22 ,
  17 21 23 ⟶ 0 12 9 23 ,
  17 21 24 ⟶ 0 12 9 24 ,
  17 21 16 ⟶ 3 14 16 ,
  17 21 22 ⟶ 3 14 22 ,
  17 21 23 ⟶ 3 14 23 ,
  17 21 24 ⟶ 3 14 24 ,
  3 4 2 ⟶ 0 12 6 ,
  3 4 5 ⟶ 0 12 7 ,
  3 4 8 ⟶ 0 12 9 ,
  3 4 10 ⟶ 0 12 11 ,
  3 4 2 ⟶ 3 4 ,
  3 4 5 ⟶ 3 13 ,
  3 4 8 ⟶ 3 14 ,
  3 4 10 ⟶ 3 15 ,
  17 25 6 ⟶ 17 18 ,
  17 25 7 ⟶ 17 25 ,
  17 25 9 ⟶ 17 21 ,
  17 25 11 ⟶ 17 26 ,
  1 2 2 →= 12 6 5 6 ,
  1 2 5 →= 12 6 5 7 ,
  1 2 8 →= 12 6 5 9 ,
  1 2 10 →= 12 6 5 11 ,
  2 2 2 →= 5 6 5 6 ,

popout

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

job log

popout

actions all output return to SRS Standard