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