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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 39 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 4 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) AND (13) QDP (14) UsableRulesProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES (18) QDP (19) QDPOrderProof [EQUIVALENT, 797 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 20 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 5 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(c(x1)) -> a(x1) a(c(b(c(x1)))) -> c(b(c(c(x1)))) c(x1) -> b(a(a(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: c(a(x1)) -> a(x1) c(b(c(a(x1)))) -> c(c(b(c(x1)))) c(x1) -> a(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: c(b(c(a(x1)))) -> c(c(b(c(x1)))) c(c(a(x1))) -> c(a(x1)) a(c(a(x1))) -> a(a(x1)) b(c(a(x1))) -> b(a(x1)) c(c(x1)) -> c(a(a(b(x1)))) a(c(x1)) -> a(a(a(b(x1)))) b(c(x1)) -> b(a(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: c_{b_1}(b_{c_1}(c_{a_1}(a_{c_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{c_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) a_{c_1}(c_{a_1}(a_{c_1}(x1))) -> a_{a_1}(a_{c_1}(x1)) a_{c_1}(c_{a_1}(a_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) a_{c_1}(c_{a_1}(a_{a_1}(x1))) -> a_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) a_{c_1}(c_{c_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) a_{c_1}(c_{b_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) a_{c_1}(c_{a_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. ---------------------------------------- (7) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = x_1 POL(a_{b_1}(x_1)) = x_1 POL(a_{c_1}(x_1)) = 1 + x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = x_1 POL(b_{c_1}(x_1)) = x_1 POL(c_{a_1}(x_1)) = x_1 POL(c_{b_1}(x_1)) = x_1 POL(c_{c_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: c_{b_1}(b_{c_1}(c_{a_1}(a_{c_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{c_1}(x1)))) a_{c_1}(c_{a_1}(a_{c_1}(x1))) -> a_{a_1}(a_{c_1}(x1)) a_{c_1}(c_{a_1}(a_{b_1}(x1))) -> a_{a_1}(a_{b_1}(x1)) a_{c_1}(c_{a_1}(a_{a_1}(x1))) -> a_{a_1}(a_{a_1}(x1)) a_{c_1}(c_{c_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) a_{c_1}(c_{b_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) a_{c_1}(c_{a_1}(x1)) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) ---------------------------------------- (8) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. ---------------------------------------- (9) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (10) Obligation: Q DP problem: The TRS P consists of the following rules: C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{C_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{b_1}(x1))) C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> B_{C_1}(c_{b_1}(x1)) C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(x1) C_{B_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> C_{C_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) C_{B_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{a_1}(x1))) C_{B_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> B_{C_1}(c_{a_1}(x1)) C_{C_1}(c_{c_1}(x1)) -> B_{C_1}(x1) B_{C_1}(c_{c_1}(x1)) -> B_{C_1}(x1) The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (11) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 5 less nodes. ---------------------------------------- (12) Complex Obligation (AND) ---------------------------------------- (13) Obligation: Q DP problem: The TRS P consists of the following rules: B_{C_1}(c_{c_1}(x1)) -> B_{C_1}(x1) The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (14) 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. ---------------------------------------- (15) Obligation: Q DP problem: The TRS P consists of the following rules: B_{C_1}(c_{c_1}(x1)) -> B_{C_1}(x1) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (16) 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: *B_{C_1}(c_{c_1}(x1)) -> B_{C_1}(x1) The graph contains the following edges 1 > 1 ---------------------------------------- (17) YES ---------------------------------------- (18) Obligation: Q DP problem: The TRS P consists of the following rules: C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(x1) C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{b_1}(x1))) C_{B_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{a_1}(x1))) The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (19) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. C_{B_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{a_1}(x1))) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: <<< POL(C_{B_1}(x_1)) = [[0A]] + [[0A, -I, -I]] * x_1 >>> <<< POL(b_{c_1}(x_1)) = [[0A], [0A], [0A]] + [[-I, -I, 0A], [0A, 0A, 0A], [-I, 0A, 0A]] * x_1 >>> <<< POL(c_{a_1}(x_1)) = [[0A], [1A], [0A]] + [[-I, 0A, 0A], [0A, -I, -I], [-I, 0A, 0A]] * x_1 >>> <<< POL(a_{b_1}(x_1)) = [[0A], [0A], [0A]] + [[0A, 0A, 1A], [0A, -I, 0A], [-I, -I, -I]] * x_1 >>> <<< POL(c_{b_1}(x_1)) = [[1A], [0A], [0A]] + [[1A, -I, 0A], [-I, -I, 0A], [-I, -I, 0A]] * x_1 >>> <<< POL(a_{a_1}(x_1)) = [[0A], [1A], [0A]] + [[-I, 0A, 0A], [0A, 0A, 1A], [0A, 1A, 0A]] * x_1 >>> <<< POL(c_{c_1}(x_1)) = [[0A], [1A], [0A]] + [[0A, 1A, 1A], [-I, 0A, 0A], [0A, 0A, 0A]] * x_1 >>> <<< POL(a_{c_1}(x_1)) = [[-I], [0A], [-I]] + [[0A, 0A, 0A], [-I, -I, -I], [-I, -I, -I]] * x_1 >>> <<< POL(b_{a_1}(x_1)) = [[0A], [0A], [-I]] + [[-I, -I, -I], [-I, -I, -I], [-I, -I, -I]] * x_1 >>> <<< POL(b_{b_1}(x_1)) = [[0A], [0A], [-I]] + [[-I, -I, -I], [0A, -I, -I], [-I, -I, -I]] * x_1 >>> The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) ---------------------------------------- (20) Obligation: Q DP problem: The TRS P consists of the following rules: C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(x1) C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{b_1}(x1))) The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. 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. C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(C_{B_1}(x_1)) = x_1 POL(a_{a_1}(x_1)) = 0 POL(a_{b_1}(x_1)) = x_1 POL(a_{c_1}(x_1)) = x_1 POL(b_{a_1}(x_1)) = 0 POL(b_{b_1}(x_1)) = x_1 POL(b_{c_1}(x_1)) = 1 + x_1 POL(c_{a_1}(x_1)) = x_1 POL(c_{b_1}(x_1)) = 0 POL(c_{c_1}(x_1)) = x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) ---------------------------------------- (22) Obligation: Q DP problem: The TRS P consists of the following rules: C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{b_1}(x1))) The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (23) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. C_{B_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> C_{B_1}(b_{c_1}(c_{b_1}(x1))) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO]: POL(C_{B_1}(x_1)) = x_1 POL(a_{a_1}(x_1)) = 0 POL(a_{b_1}(x_1)) = 1 POL(a_{c_1}(x_1)) = x_1 POL(b_{a_1}(x_1)) = 0 POL(b_{b_1}(x_1)) = x_1 POL(b_{c_1}(x_1)) = x_1 POL(c_{a_1}(x_1)) = x_1 POL(c_{b_1}(x_1)) = 0 POL(c_{c_1}(x_1)) = x_1 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) ---------------------------------------- (24) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: c_{b_1}(b_{c_1}(c_{a_1}(a_{b_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{b_1}(x1)))) c_{b_1}(b_{c_1}(c_{a_1}(a_{a_1}(x1)))) -> c_{c_1}(c_{b_1}(b_{c_1}(c_{a_1}(x1)))) c_{c_1}(c_{a_1}(a_{c_1}(x1))) -> c_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{a_1}(a_{b_1}(x1))) -> c_{a_1}(a_{b_1}(x1)) c_{c_1}(c_{a_1}(a_{a_1}(x1))) -> c_{a_1}(a_{a_1}(x1)) b_{c_1}(c_{a_1}(a_{c_1}(x1))) -> b_{a_1}(a_{c_1}(x1)) b_{c_1}(c_{a_1}(a_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{c_1}(c_{a_1}(a_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) c_{c_1}(c_{b_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) c_{c_1}(c_{a_1}(x1)) -> c_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{c_1}(c_{c_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{c_1}(x1)))) b_{c_1}(c_{b_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{c_1}(c_{a_1}(x1)) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (25) PisEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R) chain. ---------------------------------------- (26) YES