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


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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277

Node 252 is start node and node 253 is final node.

Those nodes are connected through the following edges:

* 252 to 254 labelled b_1(0)* 253 to 253 labelled #_1(0)* 254 to 255 labelled a_1(0)* 255 to 256 labelled a_1(0)* 256 to 257 labelled b_1(0)* 257 to 258 labelled a_1(0)* 258 to 259 labelled a_1(0)* 259 to 260 labelled a_1(0)* 260 to 261 labelled b_1(0)* 261 to 262 labelled a_1(0)* 261 to 266 labelled b_1(1)* 262 to 263 labelled a_1(0)* 262 to 266 labelled b_1(1)* 263 to 264 labelled a_1(0)* 263 to 266 labelled b_1(1)* 264 to 265 labelled a_1(0)* 264 to 266 labelled b_1(1)* 265 to 253 labelled a_1(0)* 265 to 266 labelled b_1(1)* 266 to 267 labelled a_1(1)* 267 to 268 labelled a_1(1)* 268 to 269 labelled b_1(1)* 269 to 270 labelled a_1(1)* 270 to 271 labelled a_1(1)* 271 to 272 labelled a_1(1)* 272 to 273 labelled b_1(1)* 273 to 274 labelled a_1(1)* 273 to 266 labelled b_1(1)* 274 to 275 labelled a_1(1)* 274 to 266 labelled b_1(1)* 275 to 276 labelled a_1(1)* 275 to 266 labelled b_1(1)* 276 to 277 labelled a_1(1)* 276 to 266 labelled b_1(1)* 277 to 253 labelled a_1(1)* 277 to 266 labelled b_1(1)


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

(6)
YES