/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) Strip Symbols Proof [SOUND, 0 ms]
(2) QTRS
(3) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(4) YES


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

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

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

Q is empty.

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

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

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

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

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

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

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

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

Q is empty.

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

(3) 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:

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26

Node 15 is start node and node 16 is final node.

Those nodes are connected through the following edges:

* 15 to 17 labelled a_1(0)* 16 to 16 labelled #_1(0)* 17 to 18 labelled b_1(0)* 18 to 19 labelled a_1(0)* 19 to 20 labelled b_1(0)* 20 to 21 labelled b_1(0)* 20 to 22 labelled a_1(1)* 21 to 16 labelled a_1(0)* 22 to 23 labelled b_1(1)* 23 to 24 labelled a_1(1)* 24 to 25 labelled b_1(1)* 25 to 26 labelled b_1(1)* 25 to 22 labelled a_1(1)* 26 to 16 labelled a_1(1)


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

(4)
YES