/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 8 ms]
(6) YES


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

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

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

Q is empty.

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

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

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

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

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

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158

Node 115 is start node and node 116 is final node.

Those nodes are connected through the following edges:

* 115 to 117 labelled b_1(0)* 116 to 116 labelled #_1(0)* 117 to 118 labelled a_1(0)* 118 to 119 labelled a_1(0)* 119 to 120 labelled b_1(0)* 120 to 121 labelled a_1(0)* 120 to 149 labelled b_1(1)* 121 to 122 labelled b_1(0)* 122 to 123 labelled a_1(0)* 122 to 149 labelled b_1(1)* 123 to 124 labelled b_1(0)* 124 to 125 labelled a_1(0)* 124 to 149 labelled b_1(1)* 125 to 126 labelled b_1(0)* 126 to 116 labelled a_1(0)* 126 to 149 labelled b_1(1)* 149 to 150 labelled a_1(1)* 150 to 151 labelled a_1(1)* 151 to 152 labelled b_1(1)* 152 to 153 labelled a_1(1)* 152 to 149 labelled b_1(1)* 153 to 154 labelled b_1(1)* 154 to 155 labelled a_1(1)* 154 to 149 labelled b_1(1)* 155 to 156 labelled b_1(1)* 156 to 157 labelled a_1(1)* 156 to 149 labelled b_1(1)* 157 to 158 labelled b_1(1)* 158 to 116 labelled a_1(1)* 158 to 149 labelled b_1(1)


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

(6)
YES