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


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

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

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
212, 213, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250

Node 212 is start node and node 213 is final node.

Those nodes are connected through the following edges:

* 212 to 227 labelled b_1(0)* 213 to 213 labelled #_1(0)* 227 to 228 labelled c_1(0)* 228 to 229 labelled b_1(0)* 229 to 230 labelled a_1(0)* 230 to 231 labelled a_1(0)* 231 to 232 labelled b_1(0)* 232 to 233 labelled c_1(0)* 233 to 234 labelled b_1(0)* 234 to 235 labelled a_1(0)* 234 to 239 labelled b_1(1)* 235 to 236 labelled a_1(0)* 235 to 239 labelled b_1(1)* 236 to 237 labelled a_1(0)* 236 to 239 labelled b_1(1)* 237 to 238 labelled a_1(0)* 237 to 239 labelled b_1(1)* 238 to 213 labelled a_1(0)* 238 to 239 labelled b_1(1)* 239 to 240 labelled c_1(1)* 240 to 241 labelled b_1(1)* 241 to 242 labelled a_1(1)* 242 to 243 labelled a_1(1)* 243 to 244 labelled b_1(1)* 244 to 245 labelled c_1(1)* 245 to 246 labelled b_1(1)* 246 to 247 labelled a_1(1)* 246 to 239 labelled b_1(1)* 247 to 248 labelled a_1(1)* 247 to 239 labelled b_1(1)* 248 to 249 labelled a_1(1)* 248 to 239 labelled b_1(1)* 249 to 250 labelled a_1(1)* 249 to 239 labelled b_1(1)* 250 to 213 labelled a_1(1)* 250 to 239 labelled b_1(1)


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

(6)
YES