/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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 54 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) QDPOrderProof [EQUIVALENT, 22 ms] (13) QDP (14) PisEmptyProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 2 ms] (18) QDP (19) MNOCProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 3 ms] (22) QDP (23) PisEmptyProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) QDPOrderProof [EQUIVALENT, 25 ms] (27) QDP (28) PisEmptyProof [EQUIVALENT, 0 ms] (29) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(b(x1)))) -> b(a(b(a(x1)))) a(a(b(b(x1)))) -> a(a(a(b(x1)))) a(a(a(b(x1)))) -> b(b(a(b(x1)))) b(b(b(a(x1)))) -> b(a(b(b(x1)))) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(b(x1)))) -> a(a(a(b(x1)))) b(b(b(a(x1)))) -> b(a(b(b(x1)))) a(a(a(a(b(x1))))) -> a(b(a(b(a(x1))))) b(a(a(a(b(x1))))) -> b(b(a(b(a(x1))))) a(a(a(a(b(x1))))) -> a(b(b(a(b(x1))))) b(a(a(a(b(x1))))) -> b(b(b(a(b(x1))))) Q is empty. ---------------------------------------- (3) 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. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) a_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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_{a_1}(a_{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_{a_1}(a_{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. ---------------------------------------- (5) 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)) = 1 + x_1 POL(b_{b_1}(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) a_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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))))) ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (8) Obligation: Q DP problem: The TRS P consists of the following rules: A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{a_1}(x1))) A_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) A_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{b_1}(x1))) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1)) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> A_{A_1}(x1) B_{A_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{a_1}(x1))) B_{A_1}(a_{a_1}(a_{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))))) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> B_{A_1}(a_{b_1}(b_{b_1}(x1))) The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (9) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 12 less nodes. ---------------------------------------- (10) Complex Obligation (AND) ---------------------------------------- (11) Obligation: Q DP problem: The TRS P consists of the following rules: A_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{b_1}(x1))) A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{a_1}(x1))) The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (12) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. A_{A_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{b_1}(x1))) A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{a_1}(x1))) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(A_{A_1}(x_1)) = x_1 POL(a_{a_1}(x_1)) = 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)) = 1 + x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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))))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) ---------------------------------------- (13) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (14) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (15) YES ---------------------------------------- (16) Obligation: Q DP problem: The TRS P consists of the following rules: B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (17) 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. ---------------------------------------- (18) Obligation: Q DP problem: The TRS P consists of the following rules: B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) The TRS R consists of the following rules: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> 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. ---------------------------------------- (19) MNOCProof (EQUIVALENT) We use the modular non-overlap check [LPAR04] to enlarge Q to all left-hand sides of R. ---------------------------------------- (20) Obligation: Q DP problem: The TRS P consists of the following rules: B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) The TRS R consists of the following rules: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) The set Q consists of the following terms: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x0)))) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (21) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(x1) B_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> B_{B_1}(b_{b_1}(x1)) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(B_{B_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 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) ---------------------------------------- (22) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) The set Q consists of the following terms: b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x0)))) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (23) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (24) YES ---------------------------------------- (25) Obligation: Q DP problem: The TRS P consists of the following rules: B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{a_1}(x1)) The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (26) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B_{A_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> B_{A_1}(a_{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_{a_1}(x_1)) = x_1 POL(a_{b_1}(x_1)) = 1 + x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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))))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) ---------------------------------------- (27) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{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. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (28) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (29) YES