/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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 22 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 2 ms] (10) QTRS (11) DependencyPairsProof [EQUIVALENT, 0 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) AND (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPOrderProof [EQUIVALENT, 5 ms] (19) QDP (20) PisEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) UsableRulesProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(a(a(x1)))) -> a(b(a(a(x1)))) a(b(a(a(x1)))) -> a(b(b(a(x1)))) b(b(b(a(x1)))) -> b(b(a(b(x1)))) b(a(b(a(x1)))) -> b(a(b(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(b(x1)))) -> a(a(b(a(x1)))) a(a(b(a(x1)))) -> a(b(b(a(x1)))) a(b(b(b(x1)))) -> b(a(b(b(x1)))) a(b(a(b(x1)))) -> b(b(a(b(x1)))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(b(x1)))) -> a(a(b(a(x1)))) a(a(b(a(x1)))) -> a(b(b(a(x1)))) a(a(b(b(b(x1))))) -> a(b(a(b(b(x1))))) b(a(b(b(b(x1))))) -> b(b(a(b(b(x1))))) a(a(b(a(b(x1))))) -> a(b(b(a(b(x1))))) b(a(b(a(b(x1))))) -> b(b(b(a(b(x1))))) Q is empty. ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) Q is empty. ---------------------------------------- (7) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = 1 + x_1 POL(a_{b_1}(x_1)) = x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) ---------------------------------------- (8) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) Q is empty. ---------------------------------------- (9) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = x_1 POL(a_{b_1}(x_1)) = x_1 POL(b_{a_1}(x_1)) = 1 + x_1 POL(b_{b_1}(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) ---------------------------------------- (10) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. ---------------------------------------- (11) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (12) Obligation: Q DP problem: The TRS P consists of the following rules: A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> B_{A_1}(a_{a_1}(x1)) A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (13) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 2 less nodes. ---------------------------------------- (14) Complex Obligation (AND) ---------------------------------------- (15) Obligation: Q DP problem: The TRS P consists of the following rules: B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (16) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (17) Obligation: Q DP problem: The TRS P consists of the following rules: B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) The TRS R consists of the following rules: b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (18) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(B_{A_1}(x_1)) = x_1 POL(a_{b_1}(x_1)) = 1 + x_1 POL(b_{a_1}(x_1)) = 1 + x_1 POL(b_{b_1}(x_1)) = 1 + x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) ---------------------------------------- (19) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (20) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (21) YES ---------------------------------------- (22) Obligation: Q DP problem: The TRS P consists of the following rules: A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) The TRS R consists of the following rules: a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (23) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (24) Obligation: Q DP problem: The TRS P consists of the following rules: A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (25) QDPSizeChangeProof (EQUIVALENT) By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs: *A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (26) YES