/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) Strip Symbols Proof [SOUND, 0 ms]
(4) QTRS
(5) RFCMatchBoundsTRSProof [EQUIVALENT, 6 ms]
(6) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(b(b(a(a(a(a(x1))))))) -> a(a(a(a(a(b(b(a(a(b(b(x1)))))))))))

Q is empty.

----------------------------------------

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(a(a(a(b(b(a(x1))))))) -> b(b(a(a(b(b(a(a(a(a(a(x1)))))))))))

Q is empty.

----------------------------------------

(3) Strip Symbols Proof (SOUND)
We were given the following TRS:

   a(a(a(a(b(b(a(x1))))))) -> b(b(a(a(b(b(a(a(a(a(a(x1)))))))))))

By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: 

   a(a(a(a(b(b(x)))))) -> b(b(a(a(b(b(a(a(a(a(x))))))))))

----------------------------------------

(4)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(a(a(a(b(b(x)))))) -> b(b(a(a(b(b(a(a(a(a(x))))))))))

Q is empty.

----------------------------------------

(5) RFCMatchBoundsTRSProof (EQUIVALENT)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R.
The following rules were used to construct the certificate:

   a(a(a(a(b(b(x)))))) -> b(b(a(a(b(b(a(a(a(a(x))))))))))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
7, 8, 19, 20, 21, 22, 23, 24, 25, 26, 27, 37, 38, 39, 40, 41, 42, 43, 44, 45

Node 7 is start node and node 8 is final node.

Those nodes are connected through the following edges:

* 7 to 19 labelled b_1(0)* 8 to 8 labelled #_1(0)* 19 to 20 labelled b_1(0)* 20 to 21 labelled a_1(0)* 21 to 22 labelled a_1(0)* 22 to 23 labelled b_1(0)* 23 to 24 labelled b_1(0)* 24 to 25 labelled a_1(0)* 24 to 37 labelled b_1(1)* 25 to 26 labelled a_1(0)* 25 to 37 labelled b_1(1)* 26 to 27 labelled a_1(0)* 26 to 37 labelled b_1(1)* 27 to 8 labelled a_1(0)* 27 to 37 labelled b_1(1)* 37 to 38 labelled b_1(1)* 38 to 39 labelled a_1(1)* 39 to 40 labelled a_1(1)* 40 to 41 labelled b_1(1)* 41 to 42 labelled b_1(1)* 42 to 43 labelled a_1(1)* 42 to 37 labelled b_1(1)* 43 to 44 labelled a_1(1)* 43 to 37 labelled b_1(1)* 44 to 45 labelled a_1(1)* 44 to 37 labelled b_1(1)* 45 to 8 labelled a_1(1)* 45 to 37 labelled b_1(1)


----------------------------------------

(6)
YES