/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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:

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

Q is empty.

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

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

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

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

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

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

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

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

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:

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

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
3, 4, 18, 19, 20, 21, 22, 23, 26, 28, 30, 32, 34, 36, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54

Node 3 is start node and node 4 is final node.

Those nodes are connected through the following edges:

* 3 to 18 labelled a_1(0)* 4 to 4 labelled #_1(0)* 18 to 19 labelled a_1(0)* 19 to 20 labelled b_1(0)* 20 to 21 labelled c_1(0)* 21 to 22 labelled c_1(0)* 22 to 23 labelled a_1(0)* 23 to 26 labelled a_1(0)* 26 to 28 labelled b_1(0)* 28 to 30 labelled c_1(0)* 28 to 43 labelled a_1(1)* 30 to 32 labelled a_1(0)* 32 to 34 labelled a_1(0)* 34 to 36 labelled b_1(0)* 36 to 4 labelled c_1(0)* 36 to 43 labelled a_1(1)* 43 to 44 labelled a_1(1)* 44 to 45 labelled b_1(1)* 45 to 46 labelled c_1(1)* 46 to 47 labelled c_1(1)* 47 to 48 labelled a_1(1)* 48 to 49 labelled a_1(1)* 49 to 50 labelled b_1(1)* 50 to 51 labelled c_1(1)* 50 to 43 labelled a_1(1)* 51 to 52 labelled a_1(1)* 52 to 53 labelled a_1(1)* 53 to 54 labelled b_1(1)* 54 to 4 labelled c_1(1)* 54 to 43 labelled a_1(1)


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

(4)
YES