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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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, 0 ms]
(6) YES


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

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

   a(b(b(a(a(a(a(a(x1)))))))) -> a(a(a(a(a(a(b(b(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(a(b(b(a(x1)))))))) -> b(b(a(b(b(a(a(a(a(a(a(x1)))))))))))

Q is empty.

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

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

   a(a(a(a(a(b(b(a(x1)))))))) -> b(b(a(b(b(a(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(a(b(b(x))))))) -> b(b(a(b(b(a(a(a(a(a(x))))))))))

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

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

   a(a(a(a(a(b(b(x))))))) -> b(b(a(b(b(a(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(a(b(b(x))))))) -> b(b(a(b(b(a(a(a(a(a(x))))))))))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
7, 8, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143

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

Those nodes are connected through the following edges:

* 7 to 126 labelled b_1(0)* 8 to 8 labelled #_1(0)* 126 to 127 labelled b_1(0)* 127 to 128 labelled a_1(0)* 128 to 129 labelled b_1(0)* 129 to 130 labelled b_1(0)* 130 to 131 labelled a_1(0)* 130 to 135 labelled b_1(1)* 131 to 132 labelled a_1(0)* 131 to 135 labelled b_1(1)* 132 to 133 labelled a_1(0)* 132 to 135 labelled b_1(1)* 133 to 134 labelled a_1(0)* 133 to 135 labelled b_1(1)* 134 to 8 labelled a_1(0)* 134 to 135 labelled b_1(1)* 135 to 136 labelled b_1(1)* 136 to 137 labelled a_1(1)* 137 to 138 labelled b_1(1)* 138 to 139 labelled b_1(1)* 139 to 140 labelled a_1(1)* 139 to 135 labelled b_1(1)* 140 to 141 labelled a_1(1)* 140 to 135 labelled b_1(1)* 141 to 142 labelled a_1(1)* 141 to 135 labelled b_1(1)* 142 to 143 labelled a_1(1)* 142 to 135 labelled b_1(1)* 143 to 8 labelled a_1(1)* 143 to 135 labelled b_1(1)


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

(6)
YES