/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, 1 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:
373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394

Node 373 is start node and node 374 is final node.

Those nodes are connected through the following edges:

* 373 to 375 labelled c_1(0)* 374 to 374 labelled #_1(0)* 375 to 376 labelled a_1(0)* 376 to 377 labelled b_1(0)* 377 to 378 labelled a_1(0)* 378 to 379 labelled b_1(0)* 379 to 380 labelled c_1(0)* 380 to 381 labelled a_1(0)* 380 to 385 labelled c_1(1)* 381 to 382 labelled b_1(0)* 382 to 383 labelled c_1(0)* 383 to 384 labelled a_1(0)* 383 to 385 labelled c_1(1)* 384 to 374 labelled b_1(0)* 385 to 386 labelled a_1(1)* 386 to 387 labelled b_1(1)* 387 to 388 labelled a_1(1)* 388 to 389 labelled b_1(1)* 389 to 390 labelled c_1(1)* 390 to 391 labelled a_1(1)* 390 to 385 labelled c_1(1)* 391 to 392 labelled b_1(1)* 392 to 393 labelled c_1(1)* 393 to 394 labelled a_1(1)* 393 to 385 labelled c_1(1)* 394 to 374 labelled b_1(1)


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

(6)
YES