34.41/9.67 YES 35.00/9.83 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 35.00/9.83 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.00/9.83 35.00/9.83 35.00/9.83 Termination w.r.t. Q of the given QTRS could be proven: 35.00/9.83 35.00/9.83 (0) QTRS 35.00/9.83 (1) DependencyPairsProof [EQUIVALENT, 0 ms] 35.00/9.83 (2) QDP 35.00/9.83 (3) QDPOrderProof [EQUIVALENT, 162 ms] 35.00/9.83 (4) QDP 35.00/9.83 (5) QDPOrderProof [EQUIVALENT, 0 ms] 35.00/9.83 (6) QDP 35.00/9.83 (7) QDPOrderProof [EQUIVALENT, 40 ms] 35.00/9.83 (8) QDP 35.00/9.83 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 35.00/9.83 (10) TRUE 35.00/9.83 35.00/9.83 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (0) 35.00/9.83 Obligation: 35.00/9.83 Q restricted rewrite system: 35.00/9.83 The TRS R consists of the following rules: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 Q is empty. 35.00/9.83 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (1) DependencyPairsProof (EQUIVALENT) 35.00/9.83 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (2) 35.00/9.83 Obligation: 35.00/9.83 Q DP problem: 35.00/9.83 The TRS P consists of the following rules: 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(b(b(c(a(x1))))) 35.00/9.83 A(b(b(x1))) -> B(b(c(a(x1)))) 35.00/9.83 A(b(b(x1))) -> B(c(a(x1))) 35.00/9.83 A(b(b(x1))) -> A(x1) 35.00/9.83 B(c(x1)) -> A(x1) 35.00/9.83 35.00/9.83 The TRS R consists of the following rules: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 Q is empty. 35.00/9.83 We have to consider all minimal (P,Q,R)-chains. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (3) QDPOrderProof (EQUIVALENT) 35.00/9.83 We use the reduction pair processor [LPAR04,JAR06]. 35.00/9.83 35.00/9.83 35.00/9.83 The following pairs can be oriented strictly and are deleted. 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(b(c(a(x1)))) 35.00/9.83 The remaining pairs can at least be oriented weakly. 35.00/9.83 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(A(x_1)) = [[0A]] + [[0A, 1A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(b(x_1)) = [[1A], [-I], [-I]] + [[0A, 0A, -I], [-I, -I, 0A], [-I, 0A, -I]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(B(x_1)) = [[0A]] + [[-I, 0A, -I]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(c(x_1)) = [[0A], [-I], [-I]] + [[0A, 0A, 0A], [0A, 1A, 0A], [-I, 0A, -I]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(a(x_1)) = [[-I], [-I], [-I]] + [[0A, 1A, 0A], [-I, 0A, -I], [0A, 1A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 35.00/9.83 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (4) 35.00/9.83 Obligation: 35.00/9.83 Q DP problem: 35.00/9.83 The TRS P consists of the following rules: 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(b(b(c(a(x1))))) 35.00/9.83 A(b(b(x1))) -> B(c(a(x1))) 35.00/9.83 A(b(b(x1))) -> A(x1) 35.00/9.83 B(c(x1)) -> A(x1) 35.00/9.83 35.00/9.83 The TRS R consists of the following rules: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 Q is empty. 35.00/9.83 We have to consider all minimal (P,Q,R)-chains. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (5) QDPOrderProof (EQUIVALENT) 35.00/9.83 We use the reduction pair processor [LPAR04,JAR06]. 35.00/9.83 35.00/9.83 35.00/9.83 The following pairs can be oriented strictly and are deleted. 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(c(a(x1))) 35.00/9.83 A(b(b(x1))) -> A(x1) 35.00/9.83 The remaining pairs can at least be oriented weakly. 35.00/9.83 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(A(x_1)) = [[0A]] + [[0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(b(x_1)) = [[1A], [0A], [-I]] + [[0A, 0A, 0A], [0A, 0A, 0A], [1A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(B(x_1)) = [[0A]] + [[0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(c(x_1)) = [[0A], [0A], [0A]] + [[-I, -I, -I], [-I, 0A, 0A], [0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(a(x_1)) = [[0A], [-I], [0A]] + [[0A, 0A, 0A], [-I, 0A, 0A], [-I, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 35.00/9.83 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (6) 35.00/9.83 Obligation: 35.00/9.83 Q DP problem: 35.00/9.83 The TRS P consists of the following rules: 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(b(b(c(a(x1))))) 35.00/9.83 B(c(x1)) -> A(x1) 35.00/9.83 35.00/9.83 The TRS R consists of the following rules: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 Q is empty. 35.00/9.83 We have to consider all minimal (P,Q,R)-chains. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (7) QDPOrderProof (EQUIVALENT) 35.00/9.83 We use the reduction pair processor [LPAR04,JAR06]. 35.00/9.83 35.00/9.83 35.00/9.83 The following pairs can be oriented strictly and are deleted. 35.00/9.83 35.00/9.83 A(b(b(x1))) -> B(b(b(c(a(x1))))) 35.00/9.83 The remaining pairs can at least be oriented weakly. 35.00/9.83 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(A(x_1)) = [[0A]] + [[0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(b(x_1)) = [[0A], [0A], [0A]] + [[0A, 0A, 1A], [0A, 0A, 0A], [0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(B(x_1)) = [[0A]] + [[-I, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(c(x_1)) = [[-I], [0A], [-I]] + [[0A, 0A, 0A], [0A, 0A, 0A], [-I, -I, -I]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 <<< 35.00/9.83 POL(a(x_1)) = [[0A], [0A], [0A]] + [[0A, 0A, 0A], [0A, 0A, -I], [0A, 0A, 0A]] * x_1 35.00/9.83 >>> 35.00/9.83 35.00/9.83 35.00/9.83 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (8) 35.00/9.83 Obligation: 35.00/9.83 Q DP problem: 35.00/9.83 The TRS P consists of the following rules: 35.00/9.83 35.00/9.83 B(c(x1)) -> A(x1) 35.00/9.83 35.00/9.83 The TRS R consists of the following rules: 35.00/9.83 35.00/9.83 a(x1) -> x1 35.00/9.83 a(b(b(x1))) -> b(b(b(c(a(x1))))) 35.00/9.83 b(c(x1)) -> a(x1) 35.00/9.83 35.00/9.83 Q is empty. 35.00/9.83 We have to consider all minimal (P,Q,R)-chains. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (9) DependencyGraphProof (EQUIVALENT) 35.00/9.83 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node. 35.00/9.83 ---------------------------------------- 35.00/9.83 35.00/9.83 (10) 35.00/9.83 TRUE 35.23/9.96 EOF