14.82/4.61 YES 14.82/4.64 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 14.82/4.64 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.82/4.64 14.82/4.64 14.82/4.64 Termination w.r.t. Q of the given QTRS could be proven: 14.82/4.64 14.82/4.64 (0) QTRS 14.82/4.64 (1) QTRSRRRProof [EQUIVALENT, 200 ms] 14.82/4.64 (2) QTRS 14.82/4.64 (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] 14.82/4.64 (4) QTRS 14.82/4.64 (5) DependencyPairsProof [EQUIVALENT, 4 ms] 14.82/4.64 (6) QDP 14.82/4.64 (7) DependencyGraphProof [EQUIVALENT, 1 ms] 14.82/4.64 (8) TRUE 14.82/4.64 14.82/4.64 14.82/4.64 ---------------------------------------- 14.82/4.64 14.82/4.64 (0) 14.82/4.64 Obligation: 14.82/4.64 Q restricted rewrite system: 14.82/4.64 The TRS R consists of the following rules: 14.82/4.64 14.82/4.64 0(x1) -> 1(x1) 14.82/4.64 0(0(x1)) -> 0(x1) 14.82/4.64 3(4(5(x1))) -> 4(3(5(x1))) 14.82/4.64 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 0(0(1(0(1(0(0(0(0(1(0(0(0(1(0(1(1(1(1(1(1(1(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(0(1(0(0(0(1(0(1(0(1(0(0(0(0(1(1(1(1(0(0(0(1(0(1(0(0(1(0(0(0(1(1(0(0(1(0(0(0(1(1(1(0(1(1(1(0(0(1(1(1(1(1(1(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(0(1(0(0(0(0(1(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(0(0(1(1(1(0(0(0(0(1(1(1(0(0(1(0(1(1(0(0(1(1(1(0(1(0(1(1(1(1(1(0(1(0(0(0(0(1(0(0(1(0(0(0(0(0(0(1(0(1(0(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(0(1(1(1(0(0(1(0(1(1(0(1(0(1(0(1(1(0(0(0(0(1(1(0(1(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(1(1(1(0(0(1(1(0(1(1(0(0(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(1(1(0(0(1(1(1(1(0(0(1(1(1(1(0(1(0(1(0(0(0(1(1(1(0(1(0(0(0(0(0(0(0(0(1(0(1(0(1(1(1(0(1(0(0(1(0(1(1(1(0(1(0(1(0(0(1(1(0(0(0(0(1(1(1(0(1(1(1(0(0(1(1(0(1(1(1(0(1(1(1(0(1(0(0(0(0(0(1(1(0(0(0(0(1(0(0(1(0(0(1(1(1(0(1(0(1(0(0(0(0(1(1(0(1(0(0(0(1(1(0(1(1(1(1(1(0(0(0(1(0(1(1(0(1(0(1(1(0(1(1(0(1(1(0(0(1(0(1(0(1(1(0(0(1(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 14.82/4.64 0(1(1(1(0(1(0(1(0(0(1(1(1(1(0(0(0(1(1(1(0(1(0(1(1(0(1(0(1(1(1(0(1(1(1(0(1(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(1(1(0(0(1(1(0(0(1(1(1(1(0(0(1(1(0(1(0(1(0(0(1(0(1(1(0(0(0(0(0(1(0(0(0(1(0(0(1(0(1(1(1(0(1(1(1(0(0(0(0(1(1(0(0(1(0(0(1(0(0(1(0(0(0(0(0(0(0(0(0(0(0(0(1(0(1(1(0(0(0(1(0(0(1(1(0(0(1(1(1(0(0(1(0(0(0(0(0(0(0(0(1(0(1(0(0(0(0(0(1(1(0(0(0(1(0(0(0(1(1(0(0(0(0(0(1(1(0(1(1(1(0(0(0(1(1(1(1(0(1(1(1(1(1(1(1(0(0(1(0(1(1(1(0(0(1(1(0(1(0(1(0(1(0(0(1(1(1(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(1(1(0(0(0(1(0(0(1(0(1(1(1(0(0(0(1(0(1(1(1(1(0(1(0(0(1(0(0(0(0(0(1(0(0(0(0(0(0(1(1(0(0(1(1(1(0(0(1(0(0(1(1(0(1(0(1(0(1(1(1(1(0(0(1(0(1(1(1(1(0(1(1(0(0(1(0(0(1(0(0(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(1(0(1(0(1(1(1(0(0(1(0(1(1(1(0(0(0(1(1(0(1(1(0(1(1(0(1(0(0(1(0(1(1(0(0(1(1(1(1(1(1(0(0(1(0(0(0(1(1(1(0(0(1(0(0(1(0(1(0(0(1(1(1(1(1(1(1(1(1(0(1(1(1(0(1(1(1(1(1(0(1(0(0(0(1(0(1(1(0(0(1(1(1(0(0(0(0(0(1(0(0(1(0(0(1(0(0(0(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 14.82/4.64 14.82/4.64 Q is empty. 14.82/4.64 14.82/4.64 ---------------------------------------- 14.82/4.64 14.82/4.64 (1) QTRSRRRProof (EQUIVALENT) 14.82/4.64 Used ordering: 14.82/4.64 Polynomial interpretation [POLO]: 14.82/4.64 14.82/4.64 POL(0(x_1)) = 9 + x_1 14.82/4.64 POL(1(x_1)) = 8 + x_1 14.82/4.64 POL(2(x_1)) = 22 + x_1 14.82/4.64 POL(3(x_1)) = x_1 14.82/4.64 POL(4(x_1)) = x_1 14.82/4.64 POL(5(x_1)) = x_1 14.82/4.64 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 14.82/4.64 14.82/4.64 0(x1) -> 1(x1) 14.82/4.64 0(0(x1)) -> 0(x1) 14.82/4.64 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 0(0(1(0(1(0(0(0(0(1(0(0(0(1(0(1(1(1(1(1(1(1(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(0(1(0(0(0(1(0(1(0(1(0(0(0(0(1(1(1(1(0(0(0(1(0(1(0(0(1(0(0(0(1(1(0(0(1(0(0(0(1(1(1(0(1(1(1(0(0(1(1(1(1(1(1(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(0(1(0(0(0(0(1(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(0(0(1(1(1(0(0(0(0(1(1(1(0(0(1(0(1(1(0(0(1(1(1(0(1(0(1(1(1(1(1(0(1(0(0(0(0(1(0(0(1(0(0(0(0(0(0(1(0(1(0(1(1(0(0(0(1(1(1(0(0(1(1(0(1(0(1(1(1(0(1(1(1(0(0(1(0(1(1(0(1(0(1(0(1(1(0(0(0(0(1(1(0(1(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(0(1(0(1(1(1(0(0(1(1(0(1(1(0(0(0(0(1(0(1(0(1(0(1(0(0(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(1(1(0(0(1(1(1(1(0(0(1(1(1(1(0(1(0(1(0(0(0(1(1(1(0(1(0(0(0(0(0(0(0(0(1(0(1(0(1(1(1(0(1(0(0(1(0(1(1(1(0(1(0(1(0(0(1(1(0(0(0(0(1(1(1(0(1(1(1(0(0(1(1(0(1(1(1(0(1(1(1(0(1(0(0(0(0(0(1(1(0(0(0(0(1(0(0(1(0(0(1(1(1(0(1(0(1(0(0(0(0(1(1(0(1(0(0(0(1(1(0(1(1(1(1(1(0(0(0(1(0(1(1(0(1(0(1(1(0(1(1(0(1(1(0(0(1(0(1(0(1(1(0(0(1(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 14.82/4.65 0(1(1(1(0(1(0(1(0(0(1(1(1(1(0(0(0(1(1(1(0(1(0(1(1(0(1(0(1(1(1(0(1(1(1(0(1(0(1(1(0(1(0(0(1(1(0(1(1(0(0(1(0(1(1(0(1(1(0(0(1(1(0(0(1(1(1(1(0(0(1(1(0(1(0(1(0(0(1(0(1(1(0(0(0(0(0(1(0(0(0(1(0(0(1(0(1(1(1(0(1(1(1(0(0(0(0(1(1(0(0(1(0(0(1(0(0(1(0(0(0(0(0(0(0(0(0(0(0(0(1(0(1(1(0(0(0(1(0(0(1(1(0(0(1(1(1(0(0(1(0(0(0(0(0(0(0(0(1(0(1(0(0(0(0(0(1(1(0(0(0(1(0(0(0(1(1(0(0(0(0(0(1(1(0(1(1(1(0(0(0(1(1(1(1(0(1(1(1(1(1(1(1(0(0(1(0(1(1(1(0(0(1(1(0(1(0(1(0(1(0(0(1(1(1(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(1(1(1(0(0(0(1(0(0(1(0(1(1(1(0(0(0(1(0(1(1(1(1(0(1(0(0(1(0(0(0(0(0(1(0(0(0(0(0(0(1(1(0(0(1(1(1(0(0(1(0(0(1(1(0(1(0(1(0(1(1(1(1(0(0(1(0(1(1(1(1(0(1(1(0(0(1(0(0(1(0(0(1(0(0(1(1(0(1(0(1(1(1(1(1(0(1(0(1(0(1(0(1(1(1(0(0(1(0(1(1(1(0(0(0(1(1(0(1(1(0(1(1(0(1(0(0(1(0(1(1(0(0(1(1(1(1(1(1(0(0(1(0(0(0(1(1(1(0(0(1(0(0(1(0(1(0(0(1(1(1(1(1(1(1(1(1(0(1(1(1(0(1(1(1(1(1(0(1(0(0(0(1(0(1(1(0(0(1(1(1(0(0(0(0(0(1(0(0(1(0(0(1(0(0(0(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 14.82/4.65 14.82/4.65 14.82/4.65 14.82/4.65 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (2) 14.82/4.65 Obligation: 14.82/4.65 Q restricted rewrite system: 14.82/4.65 The TRS R consists of the following rules: 14.82/4.65 14.82/4.65 3(4(5(x1))) -> 4(3(5(x1))) 14.82/4.65 14.82/4.65 Q is empty. 14.82/4.65 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (3) Overlay + Local Confluence (EQUIVALENT) 14.82/4.65 The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (4) 14.82/4.65 Obligation: 14.82/4.65 Q restricted rewrite system: 14.82/4.65 The TRS R consists of the following rules: 14.82/4.65 14.82/4.65 3(4(5(x1))) -> 4(3(5(x1))) 14.82/4.65 14.82/4.65 The set Q consists of the following terms: 14.82/4.65 14.82/4.65 3(4(5(x0))) 14.82/4.65 14.82/4.65 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (5) DependencyPairsProof (EQUIVALENT) 14.82/4.65 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (6) 14.82/4.65 Obligation: 14.82/4.65 Q DP problem: 14.82/4.65 The TRS P consists of the following rules: 14.82/4.65 14.82/4.65 3^1(4(5(x1))) -> 3^1(5(x1)) 14.82/4.65 14.82/4.65 The TRS R consists of the following rules: 14.82/4.65 14.82/4.65 3(4(5(x1))) -> 4(3(5(x1))) 14.82/4.65 14.82/4.65 The set Q consists of the following terms: 14.82/4.65 14.82/4.65 3(4(5(x0))) 14.82/4.65 14.82/4.65 We have to consider all minimal (P,Q,R)-chains. 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (7) DependencyGraphProof (EQUIVALENT) 14.82/4.65 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node. 14.82/4.65 ---------------------------------------- 14.82/4.65 14.82/4.65 (8) 14.82/4.65 TRUE 15.11/4.75 EOF