SRS Standard pair #516968339

details

property	value
status	complete
benchmark	z070.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	Zantema_04

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.914041042328 seconds
cpu usage	1.866420689
max memory	5.51264256E8

stage attributes

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

The system was reversed.

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

The system was filtered by the following matrix interpretation
of type E_J with J = {1,...,2} and dimension 2:

0 ↦ ⎛     ⎞
    ⎜ 1 2 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

1 ↦ ⎛     ⎞
    ⎜ 1 2 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

2 ↦ ⎛     ⎞
    ⎜ 1 3 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

3 ↦ ⎛     ⎞
    ⎜ 1 2 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

4 ↦ ⎛     ⎞
    ⎜ 1 3 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

5 ↦ ⎛     ⎞
    ⎜ 1 3 ⎟
    ⎜ 0 1 ⎟
    ⎝     ⎠

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

popout

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

job log

popout

actions all output return to SRS Standard