/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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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(b(a(a(b(x1)))))) -> a(a(b(b(a(b(a(x1))))))) Q is empty. ---------------------------------------- (1) Strip Symbols Proof (SOUND) We were given the following TRS: a(b(b(a(a(b(x1)))))) -> a(a(b(b(a(b(a(x1))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: b(b(a(a(b(x1))))) -> a(b(b(a(b(a(x1)))))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(a(a(b(x1))))) -> a(b(b(a(b(a(x1)))))) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 0. This implies Q-termination of R. The following rules were used to construct the certificate: b(b(a(a(b(x1))))) -> a(b(b(a(b(a(x1)))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 4, 5, 43, 44, 45, 46, 47 Node 4 is start node and node 5 is final node. Those nodes are connected through the following edges: * 4 to 43 labelled a_1(0)* 5 to 5 labelled #_1(0)* 43 to 44 labelled b_1(0)* 44 to 45 labelled b_1(0)* 45 to 46 labelled a_1(0)* 46 to 47 labelled b_1(0)* 47 to 5 labelled a_1(0) ---------------------------------------- (4) YES