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


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

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

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

Q is empty.

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

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

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

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

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

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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405

Node 384 is start node and node 385 is final node.

Those nodes are connected through the following edges:

* 384 to 386 labelled c_1(0)* 385 to 385 labelled #_1(0)* 386 to 387 labelled a_1(0)* 387 to 388 labelled b_1(0)* 388 to 389 labelled a_1(0)* 389 to 390 labelled b_1(0)* 390 to 391 labelled c_1(0)* 391 to 392 labelled a_1(0)* 391 to 396 labelled c_1(1)* 392 to 393 labelled b_1(0)* 393 to 394 labelled c_1(0)* 394 to 395 labelled a_1(0)* 394 to 396 labelled c_1(1)* 395 to 385 labelled b_1(0)* 396 to 397 labelled a_1(1)* 397 to 398 labelled b_1(1)* 398 to 399 labelled a_1(1)* 399 to 400 labelled b_1(1)* 400 to 401 labelled c_1(1)* 401 to 402 labelled a_1(1)* 401 to 396 labelled c_1(1)* 402 to 403 labelled b_1(1)* 403 to 404 labelled c_1(1)* 404 to 405 labelled a_1(1)* 404 to 396 labelled c_1(1)* 405 to 385 labelled b_1(1)


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

(6)
YES