YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 26 ms] (4) RelTRS (5) RIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(x) -> x g(x) -> x The relative TRS consists of the following S rules: f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is f(x) -> x g(x) -> x The set of rules S is f(x) -> g(x) g(x) -> f(x) We have obtained the following relative TRS: The set of rules R is f(x) -> x g(x) -> x The set of rules S is f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(x) -> x g(x) -> x The relative TRS consists of the following S rules: f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(f(x_1)) = [[1], [2]] + [[1, 2], [1, 2]] * x_1 >>> <<< POL(g(x_1)) = [[1], [2]] + [[1, 2], [1, 2]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: f(x) -> x g(x) -> x Rules from S: none ---------------------------------------- (4) Obligation: Relative term rewrite system: R is empty. The relative TRS consists of the following S rules: f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (5) RIsEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (6) YES