/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) RFCMatchBoundsTRSProof [EQUIVALENT, 20 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(c(x1)) -> g(f(c(x1))) g(f(c(x1))) -> g(f(f(c(x1)))) g(g(x1)) -> g(f(g(x1))) f(f(g(x1))) -> g(f(x1)) Q is empty. ---------------------------------------- (1) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3. This implies Q-termination of R. The following rules were used to construct the certificate: g(c(x1)) -> g(f(c(x1))) g(f(c(x1))) -> g(f(f(c(x1)))) g(g(x1)) -> g(f(g(x1))) f(f(g(x1))) -> g(f(x1)) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 3, 4, 5, 6, 7, 17, 18, 19, 20, 21, 22, 23, 24, 25, 29, 30, 38, 39 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 3 labelled g_1(0)* 1 to 5 labelled g_1(0)* 1 to 20 labelled g_1(1)* 1 to 18 labelled g_1(1)* 1 to 23 labelled g_1(2)* 2 to 2 labelled #_1(0)* 3 to 4 labelled f_1(0)* 3 to 2 labelled f_1(0)* 3 to 17 labelled g_1(1)* 3 to 20 labelled g_1(1)* 3 to 29 labelled g_1(2)* 4 to 2 labelled c_1(0), g_1(0)* 4 to 18 labelled g_1(1)* 4 to 20 labelled g_1(1)* 4 to 23 labelled g_1(2)* 5 to 6 labelled f_1(0)* 6 to 7 labelled f_1(0)* 7 to 2 labelled c_1(0)* 17 to 2 labelled f_1(1)* 17 to 17 labelled g_1(1)* 17 to 29 labelled g_1(2)* 17 to 20 labelled g_1(1)* 18 to 19 labelled f_1(1)* 19 to 2 labelled c_1(1), g_1(1)* 19 to 18 labelled g_1(1)* 19 to 20 labelled g_1(1)* 19 to 23 labelled g_1(2)* 20 to 21 labelled f_1(1)* 21 to 22 labelled f_1(1)* 21 to 17 labelled g_1(1)* 21 to 29 labelled g_1(2), g_1(1)* 21 to 20 labelled g_1(1)* 22 to 2 labelled c_1(1)* 23 to 24 labelled f_1(2)* 24 to 25 labelled f_1(2)* 25 to 2 labelled c_1(2)* 29 to 30 labelled f_1(2)* 30 to 17 labelled g_1(2)* 30 to 29 labelled g_1(2)* 30 to 38 labelled g_1(3)* 30 to 20 labelled g_1(2), g_1(1)* 38 to 39 labelled f_1(3)* 39 to 29 labelled g_1(3) ---------------------------------------- (2) YES