SRS Standard pair #487083101

details

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

run statistics

property	value
solver	MultumNonMulta 20 June 2020 20G sparse
configuration	default
runtime (wallclock)	0.791931 seconds
cpu usage	2.09284
user time	1.85754
system time	0.235303
max virtual memory	2.5650088E7
max residence set size	328180.0

stage attributes

key	value
starexec-result	YES

output

YES

After renaming modulo { a->0, l->1, c->2, r->3 }, 
it remains to prove termination of the 4-rule system
{ 0 1 -> 1 0 ,
  0 2 -> 2 0 ,
  2 0 3 -> 3 0 ,
  1 3 0 0 -> 0 0 1 2 2 2 3 }


The system was reversed.

After renaming modulo { 1->0, 0->1, 2->2, 3->3 }, 
it remains to prove termination of the 4-rule system
{ 0 1 -> 1 0 ,
  2 1 -> 1 2 ,
  3 1 2 -> 1 3 ,
  1 1 3 0 -> 3 2 2 2 0 1 1 }


Applying the dependency pairs transformation.

After renaming modulo { (0,true)->0, (1,false)->1, (1,true)->2, (0,false)->3, (2,true)->4, (2,false)->5, (3,true)->6, (3,false)->7 },
it remains to prove termination of the 17-rule system
{ 0 1 -> 2 3 ,
  0 1 -> 0 ,
  4 1 -> 2 5 ,
  4 1 -> 4 ,
  6 1 5 -> 2 7 ,
  6 1 5 -> 6 ,
  2 1 7 3 -> 6 5 5 5 3 1 1 ,
  2 1 7 3 -> 4 5 5 3 1 1 ,
  2 1 7 3 -> 4 5 3 1 1 ,
  2 1 7 3 -> 4 3 1 1 ,
  2 1 7 3 -> 0 1 1 ,
  2 1 7 3 -> 2 1 ,
  2 1 7 3 -> 2 ,
  3 1 ->= 1 3 ,
  5 1 ->= 1 5 ,
  7 1 5 ->= 1 7 ,
  1 1 7 3 ->= 7 5 5 5 3 1 1 }


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

0 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
1 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
2 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
3 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
4 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
5 is interpreted by
 /   \
| 1 0 |
| 0 1 |
 \   /
6 is interpreted by
 /   \
| 1 1 |
| 0 1 |
 \   /
7 is interpreted by
 /   \
| 1 2 |
| 0 1 |
 \   /

After renaming modulo { 6->0, 1->1, 5->2, 2->3, 7->4, 3->5 }, 
it remains to prove termination of the 6-rule system
{ 0 1 2 -> 3 4 ,
  3 1 4 5 -> 0 2 2 2 5 1 1 ,
  5 1 ->= 1 5 ,
  2 1 ->= 1 2 ,
  4 1 2 ->= 1 4 ,
  1 1 4 5 ->= 4 2 2 2 5 1 1 }


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

popout

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

job log

popout

actions all output return to SRS Standard